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
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <complex>
#include <iterator>
#include <set>
#include <bitset>
#include <map>
#include <stack>
#include <list>
#include <queue>
#include <deque>

using namespace std;
typedef vector<int> VI;
typedef long long LL;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<double> VD;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;

typedef pair<LL,LL> PLL;
typedef vector <PLL> VPLL;

#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
#define MP make_pair
#define PF push_front

int n,t;
pair <int,string> odp;

map <int  , pair<int,string> > mem;
map <int  , pair<int,string> >::iterator it;
pair <int,string> oblicz(int x)
{
	if(x<=3)
	{
		if(x==1)
		return MP(1,"1");
		else if (x==2)
		return MP(2,"(1+1)");
		else 
		return MP(3,"(1+1+1)");
	}
	it=mem.find(x);
	if(it!=mem.end())
	return (it->second);
	pair <int,string> mini,ret;
	mini.ST=158;
	
	if(x%3)
	{
		
		
		if(!(x&1))
		{
			ret=oblicz(x/2);
			ret.ST+=2;
			
			if(ret.ST<mini.ST)
			{
				ret.ND="("+ret.ND+"*(1+1))";
				mini=ret;
			}
		}
		ret=oblicz(x-1);
		ret.ST++;
		if(ret.ST<mini.ST)
		{
			ret.ND="("+ret.ND+"+1)";
			mini=ret;
		}
	}
	else
	{
		ret=oblicz(x/3);
		ret.ST+=3;
		if(ret.ST<mini.ST)
		{
			ret.ND="("+ret.ND+"*(1+1+1))";
			mini=ret;
			
		}
		
		
		if(!(x&1))
		{
			ret=oblicz(x/2);
			ret.ST+=2;
			if(ret.ST<mini.ST)
			{
				ret.ND="("+ret.ND+"*(1+1))";
				mini=ret;
			}
		}
		else
		{
			
		}
	}
	
	return mem[x]=mini;
}
int main()
{
	ios_base::sync_with_stdio(0);
	cin>>t;
	while(t--)
	{
		cin>>n;
		//n=t;
		odp=oblicz(n);
		if(odp.ST>100)
		cout<<"NIE\n";
		else cout<<odp.ND<<"\n";
	}

}