eolymp
bolt
Try our new interface for solving problems
Problems

Count on Canton

Count on Canton

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. \textbf{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/1 4/2 5/1} In the above diagram, the first term is \textbf{1/1}, the second term is \textbf{1/2}, the third term is \textbf{2/1}, the fourth term is \textbf{3/1}, the fifth term is \textbf{2/2}, and so on. \InputFile The input list contains a single number per line and will be terminated by end-of-file. \OutputFile You are to write a program that will read a list of numbers in the range from \textbf{1} to \textbf{10^7} and will print for each number the corresponding term in Cantor's enumeration as given below.
Time limit 1 second
Memory limit 64 MiB
Input example #1
3
14
7
Output example #1
TERM 3 IS 2/1
TERM 14 IS 2/4
TERM 7 IS 1/4
Source SEERC 2004