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
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;

/**
 * Created by Lukasz.Dobrzynski on 16/11/23.
 */
public class jed {

    private long testNo;
    private Map<Integer, Result> results = new HashMap<>();
    private StringBuilder sb = new StringBuilder();

    class Result {
        int firstDivisor;
        int secondDivisor;
        int length;
        boolean minusOneNumber;
    }

    public static void main(String[] args) {
        jed app = new jed();
        app.process();
    }

    private void process() {
        Scanner scanner = new Scanner(System.in);

        long testNo = scanner.nextLong();

        for (int i = 0; i < testNo; i++) {
            if (i != 0) {
                clean();
            }
            int toSearch = scanner.nextInt();
            findEquation(toSearch);
            craeteOutput(toSearch);
            System.out.println(sb);
        }
    }

    private void clean() {
        results.clear();
        sb = new StringBuilder();
    }

    private void craeteOutput(int toSearch) {
        if (toSearch == 1) {
            sb.append("1");
            return;
        }

        if (toSearch <= 5) {
            sb.append("(");
            for (int i = 0; i < toSearch - 1; i++) {
                sb.append("1+");
            }
            sb.append("1)");
            return;
        }

        Result result = results.get(toSearch);

        if (result.length > 100) {
            sb.append("NIE");
            return;
        }

        sb.append("(");
        craeteOutput(result.firstDivisor);
        sb.append("*");
        craeteOutput(result.secondDivisor);

        if (result.minusOneNumber) {
            sb.append("+1");
        }
        sb.append(")");
    }

    private void findEquation(int toSearch) {
        if (toSearch <= 5) {
            return;
        }

        if (results.containsKey(toSearch)) {
            return;
        }

        Result result = new Result();

        int firstDivisor = findDivisor(toSearch);
        boolean decrement = firstDivisor == -1;

        if (decrement) {
            toSearch -= 1;
            firstDivisor = findDivisor(toSearch);
        }

        results.put(toSearch, result);

        int secondDivisor = toSearch / firstDivisor;

        findEquation(firstDivisor);
        findEquation(secondDivisor);

        result.firstDivisor = firstDivisor;
        result.secondDivisor = secondDivisor;
        int firstDivisoLength = (firstDivisor <= 5 ? firstDivisor : results.get(firstDivisor).length);
        int secondDivisoLength = (secondDivisor <= 5 ? secondDivisor : results.get(secondDivisor).length);
        result.length = firstDivisoLength + secondDivisoLength;

        if (decrement) {

            Result original = new Result();
            original.firstDivisor = result.firstDivisor;
            original.secondDivisor = result.secondDivisor;
            original.length = result.length + 1;
            original.minusOneNumber = true;

            results.put(toSearch + 1, original);
        }
    }

    private int findDivisor(int toSearch) {
        if (toSearch % 2 == 0) {
            return 2;
        }
        int sqrt = (int) Math.sqrt(toSearch);
        for (int i = 3; i <= sqrt; i += 2) {
            if (toSearch % i == 0) {
                return i;
            }
        }
        return -1;
    }


}