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
// Author: Krzysztof Bochenek
// Email:  kpbochenek@gmail.com
// --------------------------------
#include <stdio.h>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <math.h>
#include <algorithm>
#include <string>
#include <iostream>

typedef long long int ll;
typedef unsigned long long ull;

using namespace std;


string calc(int n) {
  if (n <= 1) return "";

  string result;
  if (n % 3 == 0) {
    string tmp = calc( n / 3);
    if (tmp == "()" || tmp == "") {
      result = "(1+1+1)";
    } else {
      if (tmp[tmp.length()-1] == ')') {
        result = tmp + "*(1+1+1)";
      } else {
        result = "(" + tmp + ")*(1+1+1)";
      }
    }
  } else if (n % 2 == 0) {
    string tmp = calc( n / 2);
    if (tmp == "()" || tmp == "") {
      result = "(1+1)";
    } else {
      if (tmp[tmp.length()-1] == ')') {
        result = tmp + "*(1+1)";
      } else {
        result = "(" + tmp + ")*(1+1)";
      }
    }
  } else {
    string tmp = calc( n - 1);
    if (tmp == "()" || tmp == "") {
      result = "+1";
    } else {
      if (tmp[tmp.length()-1] == ')') {
        result = tmp + "+1";
      } else {
        result = "(" + tmp + ")+1";
      }
    }
  }
  return result;
}


int main() {
  int t, k;

  cin >> t;

  while (t --> 0) {
    cin >> k;

    if (k == 1) {
      cout << "1";
    } else {
      string answer = calc(k);
      if (count(answer.begin(), answer.end(), '1') > 100) {
        cout << "NIE";
      } else {
        cout << answer;
      }
    }
    cout << endl;
  }

  return 0;
}