Problem hidden
This problem was hidden by Editorial Board member probably because it has incorrect language version or invalid test data, or description of the problem is not clear.

## CANTON2 - Count on Cantor (challenge)

One of the famous proofs of modern mathematics is Georg Cantor's demonstration that the set of rational numbers is enumerable. The proof works by using an explicit enumeration of rational numbers as shown in the diagram below.

`1/1 1/2 1/3 1/4 1/5 ...2/1 2/2 2/3 2/43/1 3/2 3/34/1 4/25/1`

In the above diagram, the first term is 1/1, the second term is 1/2, the third term is 2/1, the fourth term is 3/1, the fifth term is 2/2, and so on.

### Input

The input starts with a line containing a single integer t (t<201), the number of test cases. t test cases follow.

Then, it contains a single number per line.

### Output

You are to write a program that will read a list of numbers in the range from 1 to 10^7 and will print for each number the corresponding term in Cantor's enumeration as given below.

### Example

`Input:33147Output:2/12/41/4`

 Added by: Piotr KÄ…kol Date: 2010-05-04 Time limit: 1.824s Source limit: 50000B Memory limit: 1536MB Cluster: Cube (Intel G860) Languages: All except: SCM qobi Resource: Copy of Thanh-Vy Hua's task CANTON with different scoring