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

using namespace std;

#define PB push_back
#define FORE(i, t) for(__typeof(t.begin())i=t.begin();i!=t.end();++i)
#define SZ(x) int((x).size())
#define REP(i, n) for(int i=0,_=(n);i<_;++i)
#define FOR(i, a, b) for(int i=(a),_=(b);i<=_;++i)
#define FORD(i, a, b) for(int i=(a),_=(b);i>=_;--i)

typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

const int INF = 1e9 + 9;

string f(int k) {
    if (k == 1) {
        return "1";
    }
    if (k == 2) {
        return "(1+1)";
//        return "2";
    }
    if (k == 3) {
        return "(1+1+1)";
//        return "3";
    }
    vector<string> factors;
    FOR (b, 2, 3) {
        while (k % b == 0) {
            factors.PB(f(b));
            k /= b;
        }
    }
    string result = "";
    if (!factors.empty()) {
        result += factors[0];
        FOR(i, 1, SZ(factors) - 1) {
            result += "*" + factors[i];
        }
    }
    if (k > 1) {
        if (!result.empty()) {
            result += "*";
        }
        result += "(1+" + f(k - 1) + ")";
    }
    return result;
}

void inline one() {
    int k;
    cin >> k;
    cout << f(k) << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    int z; cin >> z; while(z--)
    one();
}