Not representable number#1071

Not representable number

1 second
128 megabytes
Very easy

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.

Input

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.

Output

Print the smallest positive integer that cannot be represented as described above.

Examples

Example 1

Loading
Loading