You have n coins with positive integer values. What is the smallest sum you cannot create using a subset of the coins?
Input
The first input line has an integer n: the number of coins.
The second line has n integers x1,x2,…,xn: the value of each coin.
Output
Print one integer: the smallest coin sum.
Constraints
1≤n≤2⋅105
1≤xi≤109
Example
Input:
5
2 9 1 2 7
Output:
6
27 мар 2022
