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
54
55
56
#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,b) for (int i = (a); i <= (b); ++i)
#define REPD(i,a,b) for (int i = (a); i >= (b); --i)
#define FORI(i,n) REP(i,1,n)
#define FOR(i,n) REP(i,0,int(n)-1)
#define mp make_pair
#define pb push_back
#define sz(x) int((x).size())
#define dbg(v) cerr << #v << " = " << (v) << endl;
#define FOREACH(i,t) for (__typeof(t.begin()) i = t.begin(); i != t.end(); ++i)
#define fi first
#define se second
#define pii pair<int,int>
const int INF = 2000000000;

int main() {
    int t;
    cin >> t;
    FOR(i,t) {
        int x;
        cin >> x;
        if (x == 1) {
            cout << 1 << endl;
            continue;
        }
        int y = x;
        int last = 0;
        bool tab[32];
        FOR (j,32) {
            tab[j] = y%2;
            y = y/2;
            //cout << tab[j] << " ";
            if (y == 0) {
                last = j;
                break;
            }
        }
        //cout << endl << last << endl;
        for (int j=last;j>=2;--j) {
            cout << "(1+1)*(";
        }
        cout << "1+1";
        if (tab[last-1])
            cout << "+1";
        for (int j=last-2;j>=0;--j) {
            if (tab[j])
                cout << ")+1";
            else
                cout << ")";
        }
        cout << endl;

    }
    return 0; //case 0?
}