Write a program that inputs a sequence of N integers and finds out the smallest positive integer that cannot be presented as a sum of the elements of any subsequence (consisting of one or more elements, not necessarily consecutive) of the given sequence.

Write a program that inputs a sequence of Nintegers and finds out the smallest positive integer that cannot be presented as a sum of the elements of any subsequence (consisting of one or more elements, not necessarily consecutive) of the given sequence. Input On the first line, a value of N is written. On the second line, the elements of the given sequence are written, separated by spaces. Output One integer equals to the requested value. Constraints: 1