FAMILYP  Family Problems
Asif and Nafisa are very interested in solving puzzles.They always try to give one another puzzles to see who is the best.So ,as usual, one day, Nafisa gave Asif a matrix.
The matrix is as follows
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z A B C ......
B C D E F G H I J K L M N O P Q R S T U V W X Y Z A B C D ......
C D E F G H I J K L M N O P Q R S T U V W X Y Z A B C D E ......
D E F G H I J K L M N O P Q R S T U V W X Y Z A B C D E F .......
.........................................................................................
.
.
Assume that the matrix is very huge(both row and column wise). Nafisa describes a special sequence as a sequence whose first term is 'A'[element at (0,0)], second term is 'B'[element at (0,1)],third term is 'B'[element at (1,0)],fourth term is 'C'[element at (2,0)]. Now,she asks Asif to find the nth term of this special sequence. Help Asif To solve the problem.
Input
There will be multiple test cases with number N(1<=N<=1000000) per line.
Output
A character ['A''Z'] per line for each number N representing the Nth number in the special sequence.
Example
Input:
3
6
10
Output: TERM 3 IS B
TERM 6 IS C
TERM 10 IS D
hide comments
maaz:
20120328 20:44:27
Use EOF printf not required :P :P :P 

Hawk_3:
20120326 12:22:01
@ dexter... u don't need to output anything for this problem...just scan till string length is not zero..:) 

jobless:
20120325 08:27:01
delete this problem,waste of time. 

Ranker:
20120324 16:43:26
Hemant Sir,Plz correct the question. Just accept input till u get EOF and get it accepted. 

Zhouxing Shi:
20120305 09:53:57
just repeat do and do 

Ayush Verma:
20120209 14:13:42
the checking system for this prblm is screwd.


Sai Teja Pratap:
20120205 04:53:17
the question is not framed properly.


B.R.ARVIND:
20120204 18:08:44
dont waste ur time in this sum, this is useless !! just getting the input ll show AC :( @hemanth Verma :try to fix it as early as possible 

.:abacus:.:
20111218 02:59:57
use while(scanf("%ld",&n)!=EOF) 

Jeevan K. S. Chalam:
20111209 14:08:20
I seem to get correct answer for all the cases. Could you please check, where my code fails #6154599

Added by:  Hemant Verma 
Date:  20091114 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 NODEJS OBJC PERL6 SQLITE VB.NET 
Resource:  Alkhwarizm 2009 