#include <stdlib.h>
#include <stdio.h>

#define MAX_NODE 18
int tCount[MAX_NODE]; // 固定节点的个数
int nodeId[MAX_NODE]; //序号(节点最大)

void buildTc() {
    tCount[0] = tCount[1] = 1;
    nodeId[0] = 0;
    nodeId[1] = 1;
    for(int i=2;i<MAX_NODE;i++) {
        int subC = i-1;
        int sum = 0;
        for(int j=0;j<=subC;j++) {
            sum += tCount[j] * tCount[subC - j];
        }
        tCount[i] = sum;
        nodeId[i] = nodeId[i-1] + tCount[i];
//      printf("%d = %d\n", i, tCount[i]);
    }
}
int printNode(int n) {
    int nodeLevel = 0;
    for(int i=MAX_NODE-1;i>=0;i--) {
        if(n > nodeId[i]) {
            nodeLevel = i+1;
            break;
        }
    }
    int subC = nodeLevel-1;
    int nId = nodeId[subC];
    for(int j=0;j<=subC;j++) {
        int nl = nId + tCount[j] * tCount[subC-j];
        if(nl < n) {
            nId = nl;
        } else {
            // 左节点j, 右节点subC-j
            int leftCount = n - nId;
            //左边排第几
            int lIdx = leftCount / tCount[subC-j];
            int rIdx = leftCount % tCount[subC-j];
            int lRealIdx = j == 0 ? 0 : nodeId[j-1]+(rIdx != 0 ? 1 : 0) + lIdx;
            if(lRealIdx != 0) {
                putchar('(');
                printNode(lRealIdx);
                putchar(')');
            }
            putchar('X');
            //右边排第几

            int rRealIdx = subC-j ==0 ? 0 : nodeId[subC-j-1] + (rIdx > 0 ? rIdx : tCount[subC-j]);
            if(rRealIdx != 0) {
                putchar('(');
                printNode(rRealIdx);
                putchar(')');
            }
            break;
        }
    }
}
int main() {
    buildTc();
    int n;
    char isFirst = 1;
    do {
        scanf("%d", &n);
        if(n == 0) break;
        if(isFirst) isFirst = 0; else putchar('\n');
        printNode(n);
    } while(1);
    return 0;
}