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
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.stream.Stream;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.stream.Collectors;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class jed {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        Jedynki solver = new Jedynki();
        solver.solve(1, in, out);
        out.close();
    }

    static class Jedynki {
        private String[] expr = new String[50];

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            for (int i = 1; i < 50; i++) {
                expr[i] = generate_expression(i);
            }

            int T = in.nextInt();
            while (T-- > 0) {
                int N = in.nextInt();
                out.println(find(N));
            }
        }

        private String find(int n) {
            if (n == 1) {
                return "1";
            }

            if (n % 2 == 0) {
                int maxPowerOfTwo = findMax(n);
                return String.format("(%s*%s)", expr[maxPowerOfTwo], find(n / (1 << maxPowerOfTwo)));
            }

            return String.format("(1+%s)", find(n - 1));
        }

        private int findMax(int n) {
            int bit = 0;
            while (n % 2 == 0) {
                bit++;
                n /= 2;
            }
            return bit;
        }

        private String generate_expression(int factors) {
            String term[] = new String[factors];
            Arrays.fill(term, "(1+1)");

            return Arrays.stream(term).collect(Collectors.joining("*"));
        }

    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

    }
}