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 <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i = (a); i <= (b); ++i)
#define FORD(i,a,b) for(int i = (a); i >= (b); --i)
#define RI(i,n) FOR(i,1,(n))
#define REP(i,n) FOR(i,0,(n)-1)
#define mini(a,b) a=min(a,b)
#define maxi(a,b) a=max(a,b)
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define sz(w) (int) w.size()
typedef vector<int> vi;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<pii, int> para;
const int inf = 1e9 + 7;
const int maxN = 1<<22;

int n, t, ileNawiasow;

string jeden = "+1";
string dwa = "*(1+1)";

string solve(int n, int krok) {
	//cout<<n<<endl;
	if (n == 1) {
		string ans = "";
		while (krok > 0) {
			ans += "(";
			krok--;
		}
		return ans + "1";
	}
	
	if (n % 2 == 0) {
		return solve(n / 2, krok + 1) + dwa + ")";
	}
	return solve(n - 1, krok + 1) + jeden + ")"; 
}

int main() {
	ios_base::sync_with_stdio(0);
	cin>>t;
	while (t--) {
		cin>>n;
		cout<<solve(n, 0)<<"\n";
	}
	return 0;
}