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
#include <stdlib.h>
#include <iostream>

bool walk( const int k, const int left, std::string& result )
{
	if ( left == 0 )
	{
		return false;
	}

	if ( k == 1 )
	{
		result += "1";
		return true;
	}

	if ( k == 2 )
	{
		result += "1+1";
		return true;
	}

	if ( k & 1 )
	{
		result += "1+";
		if ( !walk( k - 1, left - 1, result ) )
		{
			return false;
		}
		return true;
	}

	result += "(1+1)*(";
	if ( !walk( k / 2, left - 2, result ) )
	{
		return false;
	}
	result += ")";
	return true;
}

void solve()
{
	int k;
	std::cin >> k;

	std::string result;
	if ( walk( k, 100, result ) )
	{
		std::cout << result.c_str() << std::endl;
		return;
	}

	std::cout << "NIE" << std::endl;
}

int main()
{
	int t;
	std::cin >> t;

	for ( int i = 0; i < t; ++i )
		solve();

	return 0;
}