Tower of Hanoi Minimum Moves

Tower of Hanoi Minimum Moves

Compute the fewest moves to solve Tower of Hanoi with N disks.

Input format

A single line with one integer N (1 <= N <= 62): the number of disks.

Output format

Print the minimum number of moves needed to solve Tower of Hanoi with N disks, which equals 2^N - 1.

Constraints

• Values fit in a 64-bit signed integer
• Trailing whitespace and a trailing newline are ignored by the judge

Read from stdin, write to stdout. Sample cases below show the exact format.

1

1

2

3