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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
#include <math.h>
#include <stdint.h>
#include <string.h>
#include <vector>
#include <map>
#include <iostream>


static const uint32_t MAX = 100;


static std::map<uint32_t, std::pair<uint32_t, std::string>> NUMBERS = {
	{ 1, { 1, "1" } },
	{ 2, { 2, "1+1" } },
	{ 3, { 3, "1+1+1" } },
	{ 4, { 4, "1+1+1+1" } },
	{ 5, { 5, "1+1+1+1+1" } }
};


//
//
//
void get_dividers(uint32_t k, std::vector<uint32_t> &dividers)
{
	uint32_t s = sqrt(k);

	//
	// d == 2
	//
	while (k % 2 == 0)
	{
		dividers.push_back(2);
		k /= 2;
	}

	//
	// odd ds
	//
	uint32_t d = 3;

	while (k > 1 && d <= s)
	{
		while (k % d == 0)
		{
			dividers.push_back(d);
			k /= d;
		}
		d += 2;
	}

	//
	// last divisor
	//
	if (k > 1)
	{
		dividers.push_back(k);
	}
}


//
// Values of primes
//
uint32_t gen_value(uint32_t number, std::string &s)
{
	//
	auto iter = NUMBERS.find(number);

	if (iter != NUMBERS.end())
	{
		s = iter->second.second;
		return iter->second.first;
	}

	//
	std::vector<uint32_t> dividers;
	get_dividers(number - 1, dividers);

	//
	uint32_t result = 0;

	for (size_t i = 0; i < dividers.size(); ++i)
	{
		std::string temp;
		result += gen_value(dividers[i], temp);

		if (i != 0) { s += "*"; }
		s += "(" + temp + ")";
	}

	s += "+1";

	// DEBUG
	//printf("number: [%u], value: [%u], str: [%s]\n", number, result + 1, s.c_str());

	NUMBERS.insert(std::make_pair(number, std::make_pair(result + 1, s)));
	return result + 1;
}


uint32_t get_value(uint32_t number)
{
	//
	auto iter = NUMBERS.find(number);

	if (iter != NUMBERS.end()) {
		return iter->second.first;
	}

	//
	std::string temp;
	return gen_value(number, temp);
}


void print_value(uint32_t number)
{
	auto iter = NUMBERS.find(number);

	if (iter != NUMBERS.end()) {
		std::cout << iter->second.second;
		return;
	}

	throw "Error: print_value: no value!!!";
}


//
//
//
void print_dividers(uint32_t *dividers, uint32_t size)
{
	for (uint32_t i = 0; i < size; ++i)
	{
		if (i > 0) { std::cout << "*"; }

		std::cout << "(";
		print_value(dividers[i]);
		std::cout << ")";
	}
}


//
//
//
bool factorize(uint32_t k)
{
	uint32_t s = sqrt(k);

	uint32_t dividers[(MAX / 2) + 1];
	uint32_t index = 0;
	uint32_t sum = 0;

	//
	// d == 2
	//
	while (k % 2 == 0)
	{
		dividers[index] = 2;
		index++;
		sum += 2;

		if (sum > MAX) { return false; }

		k /= 2;
	}

	//
	// odd ds
	//
	uint32_t d = 3;

	while (k > 1 && d <= s)
	{
		while (k % d == 0)
		{
			dividers[index] = d;
			index++;
			sum += get_value(d);

			if (sum > MAX) { return false; }

			k /= d;
		}
		d += 2;
	}

	//
	// last divisor
	//
	if (k > 1)
	{
		dividers[index] = k;
		index++;
		sum += get_value(k);

		if (sum > MAX) { return false; }
	}

	//
	// print result
	//
	print_dividers(dividers, index);

	std::cout << std::endl;
	return true;
}


void process_test_case()
{
	uint32_t K = 0;
	std::cin >> K;

	//
	if (K <= 1)
	{
		for (uint32_t i = 0; i < K - 1; ++i)
		{
			std::cout << "1+";
		}

		std::cout << "1" << std::endl;
		return;
	}

	//
	if (factorize(K) == true)
	{
		return;
	}

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


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

	int T = 0;
	std::cin >> T;

	for (int i = 0; i < T; ++i)
	{
		process_test_case();
	}

	return 0;
}