Let number be a precise square if there exists natural number such that B \cdot B = A.
-digit number without leading zeroes is called a supersquare if it is a precise square and both -digit numbers which are formed from its first digits and its last digits are precise squares. The second -digit number d_n d_{n-1} \ldots d_1 formed from last digits may have leading zeroes but must not be equal to zero.

You need to write a program which constructs a -digit number which is supersquare.
Input file contains several test cases. The first line contains the number of test cases (1 \le T \le 10). Each of the next lines describes one test case and contains an integer number (1 \le n \le 500).
Output file consists of lines, one line per each test case. Each line contains -digit supersquare number. If several solutions are possible only one of them should be given. When it is impossible to construct -digit supersquare, the line must contain NO SUPERSQUARE POSSIBLE phrase.
Example 1