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
rohansmurf1:
20171023 21:50:35
AC in one go 

shashank_222:
20171017 15:29:34
AC in one go 

chethanc:
20170927 17:33:16
No Python? 

shubham_001:
20170918 19:50:35
: found number of rectangles accidentally costed WAs 

perrysama:
20170912 11:10:28
AC in 1 go , those who Are struggling (Hint : for N=2 Squares= 4+1) 

shubham_it3:
20170911 12:52:09
my answer is correct even i am taking care of 0 and negative value ,still my answer is not correct ,i am doing it using throgh sum of 1st n square. 

anshu_2761:
20170815 22:24:19
after getting the first answer, reset the ans=0 again then you will get correct answer for further inputs


softxide:
20170807 05:08:04
please try to find the formula on your own by studying the giving example and use it for n =3 

cis_pie:
20170701 07:22:38
I derived the formula from my basic permutation combination knowledge. You can also think about it simple! 

larunrahul:
20170623 10:59:09
Nice problem. Just observe the pattern. 
Added by:  Diego Satoba 
Date:  20081123 
Time limit:  0.165s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  ASM64 C CPP C++ 4.3.2 FORTRAN JAVA PASGPC PASFPC 
Resource:  South American Regional Contests 2008 