#### Registered Users Only

Please login to utilize this feature.

Do note that this website only supports submissions in C++.

## Problem Description

Remember the problem, triangle numbers? Now we have a squares variant of it. Observe the following squares with length *n*:

n = 1 * n = 2 ** ** n = 3 *** *** *** n = 4 **** **** **** **** n = 5 ***** ***** ***** ***** *****

Your task is to find the number of asterisks, (square numbers) given the length of the square, *n*.

## Input

A single integer, *n*, which denotes the length of the square.

## Output

A single number, the number of asterisks in the square.

## Sample Input

3

## Sample Output

9

### Tags

### Subtasks and Limits

Subtask | Score | #TC | Time | Memory | Scoring |
---|---|---|---|---|---|

1 | 100 | 10 | 1s | 32MB | Average |

2 | 0 | 1 | 1s | 32MB | Average |

### Judge Compile Command

g++-8 ans.cpp -o squarenumbers -Wall -Wshadow -static -O2 -lm -m64 -s -w -std=gnu++17 -fmax-errors=512