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
#include <stdio.h>
#include <time.h>
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <map> 
#include <string>
#include <vector>  
#include <iostream> 
#include <sstream> 
#include <queue>
#include <algorithm>
#include <assert.h>

using namespace std;
 
#define ll long long
#define PB 		push_back
#define FOR(a,start,end) 	for(int a=int(start); a<int(end); a++)
#define INF 		INT_MAX
#define SORT(a) 	sort(a.begin(),a.end()) 
#define CL(a,x) 		memset(a,x,sizeof(a))
#define REP(a,x)	for(int a=0;a<x;a++)
#define REP1(a,x)	for(int a=1;a<=x;a++)
#define MP 		make_pair

 
 
typedef vector<int>     vi;
typedef pair<int,int>     pii; 
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vector<int> > vvi;
typedef vector<vector<string> > vvs;
typedef vector<pair<string,string> > vss;
typedef pair<string,string> pss; 
typedef pair<int,pii> ppii;
typedef vector<ppii> vppii;
typedef vector<vector<pii> > vvii;
typedef vector<vvi> vvvi;


int n,t,i,a,b,cas,k,z,j;

string w;

string dal(string w, int n){
	
	if(n<4){
		w+="(1";
		
		for(i=1;i<n;i++){
				w+="+1";
		}
		w+=")";
	}
	else {
		if(n%2){
			w+="(1+";
			w=dal(w,n-1);
			w+=")";
		}
		else {
			w+="(1+1)*";
			w=dal(w,n/2);
				
		}
	}
	return w;

}
int main() {  
	//freopen( "c:\\wojtek\\uva\\pa\\debug\\t1.in", "rt", stdin);  
	
	//pi=2*acos(0.0);
	 
	cin>>t;
	for(cas=0;cas<t;cas++){
		cin>>n;
		k=n;
		w.clear();
		if(n<4){
			w="1";
			for(i=1;i<n;i++){
				w+="+1";
			}
		}
		else {
			if(n%2){
				w+="1+";
				w=dal(w,n-1);
			}
			else {
				w+="(1+1)*";
				w=dal(w,n/2);
			}
		}
		z=0;
		for(i=0;i<w.size();i++){
			if(w[i]=='1')
				z++;
		}
		if(z>100)
//			cout<<"BLAD! z = "<<z<<"dla n= "<<k<<endl;
			cout<<"NIE"<<endl;
		cout<<w<<endl;
		
	}


	//czas = clock() - czas;
	//printf("%lf\n",double(czas)/CLOCKS_PER_SEC);					

			
	return 0;
	 
}