SAMER08F  Feynman
Richard Phillips Feynman was a well known American physicist and a recipient of the Nobel Prize in Physics. He worked in theoretical physics and also pioneered the field of quantum computing. He visited South America for ten months, giving lectures and enjoying life in the tropics. He is also known for his books "Surely You're Joking, Mr. Feynman!" and "What Do You Care What Other People Think?", which include some of his adventures below the equator.
His lifelong addiction was solving and making puzzles, locks, and cyphers. Recently, an old farmer in South America, who was a host to the young physicist in 1949, found some papers and notes that is believed to have belonged to Feynman. Among notes about mesons and electromagnetism, there was a napkin where he wrote a simple puzzle: "how many different squares are there in a grid of N ×N squares?".
In the same napkin there was a drawing which is reproduced below, showing that, for N=2, the answer is 5.
Input
The input contains several test cases. Each test case is composed of a single line, containing only one integer N, representing the number of squares in each side of the grid (1 ≤ N ≤ 100).
The end of input is indicated by a line containing only one zero.
Output
For each test case in the input, your program must print a single line, containing the number of different squares for the corresponding input.
Example
Input: 2 1 8 0 Output: 5 1 204
hide comments
garima gupta:
20190325 16:34:29
AC in one go!! 

msnitish:
20190325 16:13:46
How do we take inputs continously ? Should I use while (cin >> x && x!=0) ?


gully_boy_:
20190325 08:25:18
Is input example wrong? 

a_code_runner:
20190304 10:54:08
O(1) solution. 

silentknight16:
20190221 16:44:57
AC in one go!!


iamabhishiek:
20181222 12:31:31
sum 0f square


aashish_a2z:
20181130 16:27:12
AC in first go.....Just take pen and paper and observe the logic....If anyone can then u can too...:) 

midoriya:
20181014 21:26:44
AC in one go just you need to apply basic logic 

adipat:
20181012 16:38:27
Can be done in O(n) but with a bit of math , there is an O(1) solution too. Extremely easy problem. 

akbar_1214:
20181012 07:30:50
How is the input format?? 
Added by:  Diego Satoba 
Date:  20081123 
Time limit:  0.165s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  ASM64 C C++ 4.3.2 CPP FORTRAN JAVA PASGPC PASFPC 
Resource:  South American Regional Contests 2008 