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
shyamala1307:
20180406 21:07:32
AC in one go 

kamarthapunick:
20180405 11:28:10
We can solve by using recursion. 

rashmit:
20180316 13:04:57
no python


humble_d:
20180227 05:01:21
@le9018468 good observation 

le9018468:
20180220 03:10:20
Hint: (2n+1)(n+1)(n)/6 

ashutoshiiita:
20180217 15:27:13
Last edit: 20180217 15:27:50 

vikashumain:
20180217 11:37:24
AC in one go 

vikramvarun:
20180111 15:49:15
Why so few languages are available for this problem? 

satyavinay:
20171229 15:18:04
for who are struggling, do for input=4 o/p=30 you will get the pattern 

infinitus11:
20171209 17:24:41
how to remove tle? 
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 