Topping Combinations

In this problem, you are given an integer n representing the number of available taco toppings. Your task is to compute the number of different combinations of toppings that can be made. Since each topping can either be chosen or not, the total number of combinations is given by the formula:

\(2^n\)

For example, if there is 1 topping then there are 2 possible combinations (choose it or not). Similarly, if there are 2 toppings there are \(2^2 = 4\) combinations. This problem tests your ability to perform exponentiation efficiently using basic operations.

inputFormat

The input consists of a single line containing an integer n (0 ≤ n ≤ 30), which represents the number of toppings.

outputFormat

Output a single integer, the number of different possible ways to choose the toppings. This is equal to \(2^n\).

## sample

1

2

</p>