## 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.

### 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
 < Previous 1 2 3 4 5 6 7 8 9 10 11 Next > math_angi99: 2017-05-17 12:01:44 getting wrong answer!! wat could be the corner cases Last edit: 2017-05-17 12:03:33 rohit9934: 2017-05-04 18:52:19 guys dont scratch your heads for hours like me.It is just the Formulae for the sum of 1st n squares.Google it. ameyanator: 2017-04-25 16:28:51 you can't submit using python??? whyyyyy? :( smile9170: 2017-03-27 17:45:58 Help to write this policy program smile9170@yahoo.com send smile9170: 2017-03-27 17:44:52 input 2 99 881 output 123 891 smile9170: 2017-03-27 17:40:40 Dan tsifrt number of digits, {1,2,3 say the number is made ... and 9 digits and contain different digits, 0. Dan tsifrt number is a maximum of 9 digits. such as 9, 32, 489,98761,983245 a number of single tsifrt. A maximum of 9 digits is given to N number of write software to find the minimum number of single tsifrt be in the single digits for example, number 99 is, decide the number of single tsifrt tsifrt, 123, and 881 is a decision the decision-891, while the number of single tsifrt 133 134 . input: the number of tests on the first line, 2 <= t <= 10. The next Obey t number of shares given weak separated. output: input i line of data located in the corresponding decision of i is a number of the output file a single line. If no number given the number of single tsifrt Print to-0. Examples Input Output 2 123 99881 891 help me nitisha1: 2017-03-24 02:31:19 AC in one GO:D Vale: 2017-03-21 13:07:44 Easy one :) Just 10 lines of code, and can even be reduced to 6-7 lines and still easily readable xprilion: 2017-03-17 18:35:43 My 3rd (also consecutive) AC in one! cipher_097: 2017-02-03 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 . AC in 1 GO

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