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
nixeagle: 2011-11-07 05:12:37

Picked up an AC for this problem using C++. But seriously why no haskell? :(

Rohit: 2011-08-28 14:50:11

Y U NO let me do it in python :'(

Fedor Logachev: 2011-07-22 16:54:05

HASK HASK HASK
why only c/pascal/java?

azalathemad: 2011-07-13 17:34:14

@Ivan - are you sure? I just did it with and without a range check and both succeeded.

Ivan Malison: 2011-07-13 00:14:01

Its pretty stupid that you get a score of "wrong answer" if you don't check to make sure the value is in the right range...

Mochammad Zakiy Anwari: 2011-06-06 11:21:46

Thanks for your hint, Neeraj :).

simon: 2011-05-25 13:27:43

python please !

V0iD!: 2011-04-19 10:50:27

@ashutosh: the last input is 0...which should not be processed...

Neeraj Bhat: 2011-04-18 16:30:36

some test cases are as follows:-
for n
1: 1
2: 5
3: 14
4: 30
5: 55
6: 91
7: 140
8: 204
9: 285
10: 385

BY: Neeraj Bhat

Last edit: 2011-04-18 16:31:54
Ashutosh: 2011-04-17 09:16:08

Is input value is used as for exit.
or
1st test case value is for next test cases. if 1st test case is 2 then there will be 2 more test cases next to it.

:s


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