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
karan_gopal:
20200518 16:11:46
hint:


heyviv:
20200517 18:34:52
take continues input until 0 is entered 

surfeyone:
20200514 01:56:17
what im curious is is this napkin thing real 

kkunal_1:
20200512 17:07:48
hint: natural number square sum 

malcolm_123ssj:
20200511 15:05:46
Don't go for any formula or something. Try to solve this using recursion. It will help you visualize the problem better. Also that will serve as a great stepping stone for DP. 

abhinandan2002:
20200501 21:01:36
i don't know why here there's showing wrong answer.. everything is perfect in my code it's running perfectly on my terminal


landi58:
20200430 17:05:36
AC in first GO..Simple mathematics


pradeep_7:
20200430 05:54:05
Hint :


hritik_1105:
20200424 07:51:51
Use memoization to reduce compilation time. 

magic_mushroom:
20200421 20:28:22
This has a one line solution. 
Added by:  Diego Satoba 
Date:  20081123 
Time limit:  1s 
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 