#C9885. Sum of the n-th Row of Pascal's Triangle

    ID: 54027 Type: Default 1000ms 256MiB

Sum of the n-th Row of Pascal's Triangle

Sum of the n-th Row of Pascal's Triangle

Given an integer n, compute the sum of the elements in the n-th row of Pascal's Triangle. Recall that the n-th row corresponds to the coefficients in the expansion of \( (a+b)^n \) and that their sum is \(2^n\). This problem tests your understanding of exponents and bit manipulation.

inputFormat

The input consists of a single integer n (with constraints 0 ≤ n ≤ 50) representing the row number of Pascal's Triangle.

outputFormat

Output a single integer which is \(2^n\), representing the sum of all elements in the n-th row of Pascal's Triangle.

## sample
0
1