Sum - 2#7597

Sum - 2

1 second

64 megabytes

Very easy

Calculate the sum of a specific sequence of numbers based on the given variant number $n$ .

For each value of $n$ , the sequence is defined as follows:

$n = 1$ n = 1: $1 + 8 + 27 + 64 + 125 + 216 + 343 + 512 + 729 + 1000$ 1 + 8 + 27 + 64 + 125 + 216 + 343 + 512 + 729 + 1000

$n = 2$ n = 2: $1 + 2 + 6 + 24 + 120 + 720 + 5040 + 40320 + 362880 + 3628800$ 1 + 2 + 6 + 24 + 120 + 720 + 5040 + 40320 + 362880 + 3628800

$n = 3$ n = 3: $2 + 4 + 8 + 16 + 32 + 64 + 128 + 256 + 512 + 1024$ 2 + 4 + 8 + 16 + 32 + 64 + 128 + 256 + 512 + 1024

$n = 4$ n = 4: $1 + 4 + 9 + 16 + 25 + 36 + 49 + 64 + 81 + 100$ 1 + 4 + 9 + 16 + 25 + 36 + 49 + 64 + 81 + 100

$n = 5$ n = 5: $2 + 5 + 10 + 17 + 26 + 37 + 50 + 65 + 82 + 101$ 2 + 5 + 10 + 17 + 26 + 37 + 50 + 65 + 82 + 101

$n = 6$ n = 6: $2 + 6 + 12 + 20 + 30 + 42 + 56 + 72 + 90 + 110$ 2 + 6 + 12 + 20 + 30 + 42 + 56 + 72 + 90 + 110

Input

A single integer $n$ , where $1 \leq n \leq 6$ 1 \leq n \leq 6.

The sum of the numbers in the sequence corresponding to the given $n$ .

Example 1

Loading

n = 1

1 + 8 + 27 + 64 + 125 + 216 + 343 + 512 + 729 + 1000

n = 2

1 + 2 + 6 + 24 + 120 + 720 + 5040 + 40320 + 362880 + 3628800

n = 3

2 + 4 + 8 + 16 + 32 + 64 + 128 + 256 + 512 + 1024

n = 4

1 + 4 + 9 + 16 + 25 + 36 + 49 + 64 + 81 + 100

n = 5

2 + 5 + 10 + 17 + 26 + 37 + 50 + 65 + 82 + 101

n = 6

2 + 6 + 12 + 20 + 30 + 42 + 56 + 72 + 90 + 110

1 \leq n \leq 6