Counting Unique Non-Empty Subsets

Given an integer \(N\) representing the number of distinct elements in a set, your task is to compute the total number of unique non-empty subsets. According to combinatorial principles, the total number of non-empty subsets is given by the formula \(2^N - 1\). For instance, if \(N = 3\), the output should be \(2^3 - 1 = 7\). Solve this problem efficiently.

inputFormat

The input consists of a single integer \(N\) (\(1 \le N \le 10^5\) is typical), which denotes the number of distinct elements in the set.

outputFormat

Output a single integer which is equal to \(2^N - 1\), representing the total number of unique non-empty subsets of the set.

1

1