Count on Cantor --------------- 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/4 ... 3/1 3/2 3/3 ... 4/2 4/2 ... 5/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 1/3, the fifth term is 2/2, the sixth term is 3/1, the seventh term is 1/4, and so on. You are to write a program that will read a list of numbers in the range from 1 to 10000000 and will print for each number the corresponding term in Cantor's enumeration. Input ----- The input consists of multiple lines. Each line contains a single number between 1 and 10000000. The input is terminated by a line containing 0 (this line should not be processed). Output ------ For each line of input, one line of output is produced. If the input line contains n, then the corresponding output line contains Term n is followed by the n-th term. Sample Input ------------ 3 14 7 9999999 0 Sample Output ------------- Term 3 is 2/1 Term 14 is 4/2 Term 7 is 1/4 Term 9999999 is 2843/1630