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
57
58
59
60
61
#include <iostream>
#include <deque>
using namespace std;

deque<char> dq;
void solve(int n)
{
    if(n == 1)
    {
        dq.push_back('1');
        return;
    }
    if(n == 2)
    {
        dq.push_back('1');
        dq.push_back('+');
        dq.push_back('1');
        return;
    }
    if(n == 3)
    {
        dq.push_back('1');
        dq.push_back('+');
        dq.push_back('1');
        dq.push_back('+');
        dq.push_back('1');
        return;
    }
    solve(n/2);
    dq.push_front('(');
    dq.push_back(')');
    dq.push_back('*');
    dq.push_back('(');
    dq.push_back('1');
    dq.push_back('+');
    dq.push_back('1');
    dq.push_back(')');
    if(n&1)
    {
        dq.push_back('+');
        dq.push_back('1');
    }

}

int main()
{
    ios_base::sync_with_stdio(false);
    int t, n;
    cin >> t;
    while(t--)
    {
        dq.clear();
        cin >> n;
        solve(n);
        for(char c : dq)
            cout << c;
        cout << '\n';
    }
    return 0;
}