Unique Gift Boxes

You are given an integer n representing the number of candy types available. A gift box is created by choosing a non-empty subset of these candies. In other words, for each of the n candy types, you can decide whether to include it in the gift box or not. However, the empty set is not allowed. Thus, the total number of unique gift boxes that can be constructed is given by the formula:

$$ answer = 2^n - 1 $$

Your task is to compute this number for a given n.

inputFormat

The input consists of a single integer n (1 ≤ n ≤ 50) on standard input.

outputFormat

Output the total number of unique gift boxes that can be created, which is computed as 2^n - 1.

1

1