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
Vale:
20170321 13:07:44
Easy one :)


xprilion:
20170317 18:35:43
My 3rd (also consecutive) AC in one! 

cipher_097:
20170203 18:49:00
Draw the square for 2 , 3 , 8 and calculate the number of sub square .For 8 answer is already given as output in test case .Try to find out the pattern .If you don't get it , just google it .


themast3r:
20170123 21:05:13
Sum Of Square 

dgfreak:
20170120 21:54:50
11 lines of code, not bad IMHO. 

ignacio:
20161225 11:03:21
AC in one go, But it's no source of pride for a simple problem like this, Stop bragging


codemotto:
20161219 19:25:15
15 line code but good problem 

darpanjbora:
20161213 15:54:07
AC in one go. Just observe the pattern. ;)


bhaskar_uoh:
20161204 11:06:14
Perfect!!! its more about taking input :D 

brofreecss:
20161113 04:59:39
AC 1 GO :) 
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 