#K5911. Pascal's Triangle Row Sum

    ID: 30792 Type: Default 1000ms 256MiB

Pascal's Triangle Row Sum

Pascal's Triangle Row Sum

Given a non-negative integer n, compute the sum of the elements in the n-th row of Pascal's Triangle. It is known that the sum of the elements in the n-th row is given by the formula: \(2^n\). For example, when n = 4, the sum is \(2^4 = 16\).

Your program should read the input from stdin and output the result to stdout.

inputFormat

The input consists of a single line containing one non-negative integer n (0 ≤ n ≤ 50).

outputFormat

Output the sum of the elements in the n-th row of Pascal's Triangle as an integer.

## sample
0
1

</p>