Power of 2

Problem Description

Given a non-negative integer $\,n\,$, compute $\,2^n\,$.

Input Format

One integer $\,n\,$ ($0 \le n \le 31$).

Output Format

One integer: $2$ raised to the $\,n$-th power.

Sample Input

3

Sample Output

8

Hint

• In C++, ^ is not exponentiation — it is the bitwise XOR operator, so using it is guaranteed wrong.
• $n$ is at most $31$, and $2^{31} = 2147483648$, while the upper bound of int is $2147483647$ — off by exactly $1$! Think about which type is safe to use.
• The approach is simply to multiply by $2$ a total of $n$ times.