#K9501. N-th Cullen Number

    ID: 38768 Type: Default 1000ms 256MiB

N-th Cullen Number

N-th Cullen Number

In this problem, you are asked to compute the n-th Cullen number. The Cullen number, denoted by \( C(n) \), is defined by the formula:

\( C(n) = n \times 2^n + 1 \)

For a given integer \( n \), your task is to compute \( C(n) \) and output the result. For example, when \( n = 3 \), the Cullen number is \( 3 \times 2^3 + 1 = 25 \).

This is a straightforward implementation problem where careful handling of exponentiation is required.

inputFormat

The input is read from standard input (stdin) and consists of a single line containing one integer \( n \). You can assume that \( n \) is a positive integer.

outputFormat

Output the n-th Cullen number to standard output (stdout). The output should be a single integer corresponding to \( C(n) = n \times 2^n + 1 \).

## sample
1
3