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
#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <utility>
#include <cstdio>

#define MAX_N 1048590
//?ok?

using namespace std;
typedef long long ll;

ll n;

ll p[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97}; //25 liczb



void solve(ll k)
{

	//cout << "A" << endl;

	ll still = k;
	ll sum = 0;
	
	if(k == 1)
	{
		cout << 1 << endl;
		return;
	}
	
	while(still > 1)
	{
	
		//cout << "B, still =" << still << endl;
	
		bool stop = false;
	
		for(ll i = 0; i < 25; i++)
		{
			//cout << "C, i = " << i << endl;
			
		
			if(still%p[i] == 0)
			{
				still /= p[i];
				
				if(sum == 0 && p[i] != k)
				{
					cout << "(1";
					for(ll z = 1; z < p[i]; z++)
						cout <<"+1";
					cout <<")";
				}
				else if(p[i] == k)
				{
					cout << "1";
					for(ll z = 1; z < p[i]; z++)
						cout <<"+1";
					
				}
				else
				{
					cout << "*(1";
					for(ll z = 1; z < p[i]; z++)
						cout <<"+1";
					cout <<")";
				}
				
				sum += p[i];
				
				stop = true;
				
			}
			
			if(stop) break;
		}
		
		if(sum > 100 || !stop)
		{
			cout << "NIE" << endl;
			return;	
		}
		
	}
	
	cout << endl;
}


int main()
{
	ios_base::sync_with_stdio(false);
	
	ll t,k;
	
	cin >> t;
	
	for(ll i = 0; i < t; i++)
	{
		cin >> k;
		solve(k);
	}
	
	
	
	return 0;
}