SAMER08F - Feynman

no tags 

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 life-long 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.

subir imagenes

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
Malfple: 2014-12-10 02:25:48

If you are pretty good at squares, you can realize it in under 2 minutes. Simplest code for a hard-looking problems.

Dhruv k14: 2014-11-23 20:47:34

AC in the first go.
But I don't think its as easy as the comments suggest as I took a long time to get the logic(without using formula).

anonymous: 2014-11-19 12:46:21

@@ use array and WA WTF

Saket Sharma: 2014-10-09 22:17:43

yup!!! accepted in first go

.::Austin::.: 2014-10-09 12:36:01

after getting the logic, shortest code ever

shuks: 2014-09-20 15:44:20

Got the logic , nice question :)

CHANDAN KUMAR: 2014-09-12 15:19:51

what i have to do in case of n=0 please tell me what is the output in case of n=0

Kartik Gupta: 2014-09-10 15:41:43

AC in first go :D

arushi seth: 2014-09-07 12:40:13

very easy if you crack the logic..got green in 1st go!!


Added by:Diego Satoba
Date:2008-11-23
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:ASM64 C C++ 4.3.2 CPP FORTRAN JAVA PAS-GPC PAS-FPC
Resource:South American Regional Contests 2008