There are a group of numbers called Kaprekar Numbers. These are non-negative Integer Numbers such that the representation of their
squares can be split into two parts that add up to the original number again.For example 55 is a Kaprekar Number, because 55^2 = 3025
which can be split into 2 parts 30 and 25 such that 30+25=55. There is one special Rule : Both the parts of the sum must be positive.
This means for example 10 is not a kaprekar Number when 10^2 = 100 = 10 + 0 (but the second part of the sum is 0 , not positive).

Input
Strangely there is no input to this problem

Output
You have to print all the kaprekar Numbers in the range [2-40000] (both inclusive) each in
a separate line.

First few lines of Sample Output is given below

Sample Output
9
45
...

Problem Setter : Arjun Singh Bhatia

Languages: Brain,C,C++,Java,C#,JavaScript,Pascal,Perl,PHP,Python,Ruby,Text

Time Limit: 3 Second(s)
Score: 100 Point(s)
Input File Limit: 50000 Bytes

Mode Judge

RankNameScore
1xyz0
2Ams0
3TIP0
4team420
5xyzz0
6asdasdasd0
7abcd0
8khankhan0
9Gabriel0
10gigel0