Hide

Problem B
Cubes

Languages en sv
/problems/kuber/file/statement/en/img-0001.png
Nadja’s cubes (cc by-sa Swedish Olympiad in Informatics 2018)
Nadja is gluing together small wooden cubes with a side length of 1 to form larger compact cubes. She has now decided that she wants one cube of each side length from 1 to N. How many small cubes does Nadja need?

Input

The input consists of a single integer N on the first and only line, $1 \leq N \leq 100$.

Output

The program should output a single line containing an integer: the number of small cubes Nadja needs.

Scoring

Group

Points

Constraints

$1$

$20$

$N = 10$

$2$

$80$

No additional constraints.

Explanation of Example

In example 1, Nadja wants one cube of each side length from $1$ to $4$. Thus, she needs $1^3 + 2^3 + 3^3 + 4^3 = 100$ small cubes.

Sample Input 1 Sample Output 1
4
100
Sample Input 2 Sample Output 2
7
784