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
62
63
64
65
66
67
68
69
70
#include <bits/stdc++.h>
using namespace std;
#define e1 first
#define e2 second
#define x first
#define y second
#define pb push_back
#define mp make_pair
#define boost ios_base::sync_with_stdio(false)
#define eb emplace_back
#define OUT(x) {cout << x; exit(0); }
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define scanf(...) scanf(__VA_ARGS__)?:0
typedef int ll;
typedef unsigned long long ull;
typedef pair <int, int> PII;
typedef pair <ll, ll> PLL;
typedef pair <PLL, int> PLLI;
typedef pair <PLL, PLL> PP;
typedef pair <PII, int> PPI;
typedef pair <ll, int> PLI;
typedef unsigned int ui;
const int inf = 1e9+9;
const ll MOD = 1e9+696969;
const long long INF = 1e18+3;
const int maxn = 200100;

int T, k;
deque <char> q;
void mult2() {
	q.push_front('(');
	q.pb('*');
	q.pb('(');
	q.pb('1');
	q.pb('+');
	q.pb('1');
	q.pb(')');
	q.pb(')');
}
void add1() {
	q.push_front('(');
	q.pb('+');
	q.pb('1');
	q.pb(')');
}
void solve(int x) {
	int n = 1;
	while (n <= x) n *= 2;
	n /= 2;
	q.clear();
	q.pb('1');
	n /= 2;
	while (n >= 1) {
		mult2();
		if (n & x) add1();
		n /= 2;
	}
	
	for (auto u : q) cout << u;
	cout << "\n";
}

int main() {
	boost;
	cin >> T;
	while (T--) {
		cin >> k;
		solve(k);
	}
}