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
71
72
73
74
75
76
77
78
79
80
#include <iostream>

using namespace std;

string G;
int d = 0;
bool oper = false;
string tab[] = {"x", "1", "(1+1)", "(1+1+1)", "(1+1+1+1)", "(1+1+1+1+1)"};
void solve(int n)
{
	if(n < 6)
	{
		d += n;
		G += tab[n];
		oper = true;
	}
	int i = 2;
	while(i * i <= n)
	{
		//cout << i << endl;
		if(n % i == 0)
		{
			if(!G.empty())
			{
				if(G[G.size() - 1] != '(') G += "*";
			}
			if(i > 5)
			{
				G += "(";
				solve(i - 1);
				G += "+1)";
				d += 1;
			}
			else
			{
				G += tab[i];
				d += i;
			}
			n /= i;
			i = 2;
		}
		else i++;
	}
	if(n > 5)
	{
		if(!G.empty())
		{
			if(G[G.size() - 1] != '(') G += '*';
		}
		G += "(";
		solve(n-1);
		G += "+1)";
		d += 1;
	}
	else
	{
		G += "*";
		G += tab[n];
		d += n;
	}
}

int main()
{
	ios_base::sync_with_stdio(0);
	int t;
	int k = 10000;
	int c = 0;
	cin >> t;
	while(t--)
	{
		int i;
		cin >> i;
		solve(i);
		cout << G << '\n';
		G.clear();
		d = 0;
		oper = false;
	}
}