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
#include <iostream>
#include <set>
#include <unordered_map>
#include <algorithm>
#include <string>

using namespace std;

typedef vector<int> VI;
typedef long long LL;
#define FOR(x, b, e) for(int x = b; x<=(e);++x)
#define FORD(x, b, e) for(int x = b; x>=(e);--x)
#define REP(x, n) for(int x = 0; x < (n);++x)
#define VAR(v, n) __typeof(n)v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i,c) for(VAR(i, (c).begin()); i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second

void func(int k) {
  if(k == 1) {
    cout << "1"; return;
  } else if(k == 2) {
    cout << "(1+1)"; return;
  }

  if(k % 2 == 0) {
    k /= 2;
    cout << "(1+1)*"; if(k % 2 != 0) cout << "(";
    func(k);
    if(k % 2 != 0) cout << ")";
  } else {
    k--;
    cout << "1+";
    func(k);
  }
}

int main() {
  ios_base::sync_with_stdio(0);

  int t;
  cin >> t;

  REP(i, t) {
    int k;
    cin >> k;
    func(k); cout << endl;
  }

  return 0;
}