You are given positive integers. Find the smallest positive integer that cannot be represented as the sum of some of these numbers, where each number can be used at most once.
The first line contains the integer (1 \leq n \leq 10000). Each of the following lines contains a natural number between and 10^9 inclusive.
Print the smallest positive integer that cannot be represented as described above.
Example 1