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
iitmind:
20200106 20:03:09
Why python 3 is not supported for submission of this question? 

thiyagumessi:
20191208 14:18:01
Hint: geometric progression, use direct formulae 

akarsh777:
20191118 15:25:52
my first "ac in one go"! 

dharan1011:
20191105 20:34:55
A simple hint. Think a 4x4 square grid will have 3X3 square grid, 2X2 square grid and a 1X1 square grid. 

vishvas07:
20191002 05:46:20
AC in one go! 

aman_atg:
20190905 18:32:48
woohhhh...My first AC IN ONE GO!!!


priyansh31:
20190829 19:02:50
Good question :) Last edit: 20190904 05:37:48 

shreyans012:
20190825 04:51:26
Lovely question. Shows we have to read the problem correctly. 

shreyas_s:
20190716 08:37:05
There is no need of recursion. 

abhimanyu_1998:
20190712 22:56:55
easy ac in one go

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 