// ETI07E5v2.cpp : Defines the entry point for the console application.
//
#include <iostream>
#include <set>
#include <stdio.h>
#include <iterator>
#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;
#define MAX 50000

bool mniejsze( int PierwszyFoo, int DrugiFoo )
{
    return PierwszyFoo < DrugiFoo; 
}

struct talia //deklaracja struktury
{ 
	int idx;
	int power;
	int kryptonite;
	vector<int>intBitaPrzez;
	vector<int>intBijeJe;
	//vector<talia*>bijeTalie;
	//vector<talia*>bitaPrzez;
};

bool compareByLengthInt(const talia &a, const talia &b)
{
	return (a.power < b.power || (a.power == b.power && a.intBitaPrzez.size()>b.intBitaPrzez.size()));
}

/*bool compareByLength(const talia &a, const talia &b)
{
	return (a.power > b.power || (a.power == b.power && a.bitaPrzez.size()<b.bitaPrzez.size()));
}*/

bool compareCryptonite(const talia &a, const talia &b)
{
	return (a.power < b.power || (a.power == b.power && a.kryptonite>b.kryptonite));
}

int main()
{
	ios_base::sync_with_stdio(0);

	long long int t = 0;
	cin>>t;

/*	int firstsCount = 4846;
	int *firstsArr =  new int[firstsCount];

	firstsArr[0] = 2;
	int currentCount = 1;

	for (int j = 3; j <= 46905; j++)
	{
		double sq = sqrt(j);
		int element = 2;
		int k = 0;
		bool found = false;

		while(!found && element<=sq && k<currentCount)
		{
			if((double)j/(double)element - j/element==0)
			{
				found = true;
			}
			k++;
			if(k<currentCount)
				element = firstsArr[k];
		}

		if(!found)
		{
			firstsArr[currentCount] = j;
			currentCount++;
		}	
	}*/

	




	for (int i = 0; i < t; i++)
	{
		int n = 0;
		cin>>n;

		int reszta = n;
		//bool end = false;

		vector<int> czynniki;


	/*	double sq = std::sqrt(n);
		int element = firstsArr[0];
		bool found = false;
		int k = 0;
		while(element<=sq && !found)
		{
			if(n%element == 0)
			{
				found = true;
			}

			k++;
			element = firstsArr[k];
			
		}

		if(!found)
		{
			czynniki.push_back(1);
			reszta -=1;
			cout<<"pierwsza";
		}*/

		int j = 0;

		int proste[3] = {2,3,5};

		if(n == 1)
		{
			cout<<"1"<<endl;
		}
		else 
		{
			while(reszta != 1)
			{
				int pierwsza = proste[j];
				/*if(pierwsza>reszta)
				{
					czynniki.push_back(1);
					reszta -= 1;
				}
				else */

				if(reszta%pierwsza == 0)
				{
					czynniki.push_back(pierwsza);
					reszta /= pierwsza; 
					j = 0;
				}
				else
				{
					j++;
					if(j>2)
					{
						czynniki.push_back(1);
						reszta -= 1;
						j = 0;
					}
				}

			
			}

			int suma = 0;
			for (int i = 0; i < czynniki.size(); i++)
			{
				//cout<<czynniki[i]<<endl;
				suma += czynniki[i];
			}

			if(suma>100)
			{
				cout<<"NIE"<<endl;
			}
			else
			{
				//cout<<"TAK"<<endl;
				int wolneJedynki = 0;
				for (int i = 0; i < czynniki.size(); i++)
				{
					if(czynniki[i] == 1)
					{
						wolneJedynki++;
					}
				}
				for (int i = 0; i < wolneJedynki; i++)
				{
					cout<<"(";
				}

				for (int i = 0; i < czynniki.size(); i++)
				{
					switch (czynniki[czynniki.size()-i-1])
					{
					case 1:
						cout<<"+1)";
						break;
					case 2:
						cout<<"(1+1)";
						break;
					case 3:
						cout<<"(1+1+1)";
						break;
					case 5:
						cout<<"(1+1+1+1+1)";
						break;
					default:
						break;
					}

					int test = czynniki.size()-i-2;
					//cout<<czynniki.size()-i-2;
					if(test>-1)
					{
						if(czynniki[czynniki.size()-i-2] != 1)
						{
							cout<<"*";
						}
					}
				}
				cout<<endl;

			}
		}

		/*int m = 0;
		cin>>m;*/

		//vector<talia> talie1;
		//vector<talia> talie2;




	}

	


	return 0;
}