No Change

문제

Jack has $NN$ coins, with values $M_{1}M\_1$, $M_{2}M\_2$, \dots, $M_{N}M\_N$. Find the smallest positive amount that cannot be paid with these coins with no change.

입력

The first line contains $NN$ ($1\le N\le 10001\; \backslash le\; N\; \backslash le\; 1\backslash ,000$), the number of coins. The second line contains $NN$ integers $M_{i}M\_i$ ($1\le M_i\le 10000001\; \backslash le\; M\_i\; \backslash le\; 1\backslash ,000\backslash ,000$), the values of the coins.

출력

The only line should contain a single positive integer: the smallest amount that Jack cannot pay with his coins.