Bleatrix Trotter the sheep has devised a strategy that helps her fall asleep faster. First, she picks a number \(N\). Then she starts naming \(N, 2 \times N, 3 \times N\), and so on. Whenever she names a number, she thinks about all of the digits in that number. She keeps track of which digits (\(0, 1, 2, 3, 4, 5, 6, 7, 8\), and \(9\)) she has seen at least once so far as part of any number she has named. Once she has seen each of the ten digits at least once, she will fall asleep.

Bleatrix must start with \(N\) and must always name \((i + 1) \times N\) directly after \(i \times N\). For example, suppose that Bleatrix picks \(N = 1692\). She would count as follows:

• \(N = 1692\). Now she has seen the digits \(1, 2, 6\), and \(9\).
• \(2N = 3384\). Now she has seen the digits \(1, 2, 3, 4, 6, 8\), and \(9\).
• \(3N = 5076\). Now she has seen all ten digits, and falls asleep.

What is the last number that she will name before falling asleep? If she will count forever, print INSOMNIA instead.

Input Specification

The first line of the input gives the number of test cases, \(T\) (\(1 \le T \le 100\)). \(T\) test cases follow. Each consists of one line with a single integer \(N\) (\(0 \le N \le 10^6\)).

Output Specification

For each test case, print a line containing the last number Bleatrix will name before falling asleep, according to the rules described in the statement.

Examples

Example Input 1

5
0
1
2
11
1692

Example Output 1

INSOMNIA
10
90
110
5076

Explanation

• In Case #1, since \(2 \times 0 = 0, 3 \times 0 = 0\), and so on, Bleatrix will never see any digit other than \(0\), and so she will count forever and never fall asleep. Poor sheep!
• In Case #2, Bleatrix will name \(1, 2, 3, 4, 5, 6, 7, 8, 9, 10\). The \(0\) will be the last digit needed, and so she will fall asleep after \(10\).
• In Case #3, Bleatrix will name \(2, 4, 6...\) and so on. She will not see the digit \(9\) in any number until \(90\), at which point she will fall asleep. By that point, she will have already seen the digits \(0, 1, 2, 3, 4, 5, 6, 7\), and \(8\).
• In Case #4, Bleatrix will name \(11, 22, 33, 44, 55, 66, 77, 88, 99, 110\) and then fall asleep.
• Case #5, is the one described in the problem statement.

Source

Google Code Jam Archive