1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include <iostream>
#include <queue>
using namespace std;


void ins(int x, deque <char> &res) {

    res.push_front('(');

    if(x == 1) {
        res.push_back('+');
        res.push_back('1');
    }
    if(x == 2) {
        res.push_back('*');
        res.push_back('(');
        res.push_back('1');
        res.push_back('+');
        res.push_back('1');
        res.push_back(')');
    }

    res.push_back(')');
}

void process(int k, deque <char> &res) {
    if(k == 1) { return; }

    process(k/2, res);
    
    ins(2, res);
    if(k%2) {
        ins(1, res);
    }
}

int main() {
    int t;
    cin >> t;
    while(t--) {
        int k;
        cin >> k;
        deque <char> res;
        res.push_back('1');
        process(k, res);
        while(!res.empty()) {
            cout<<res.front();
            res.pop_front();
        }
        cout<<endl;
    }
    return 0;
}