Kolikot

import itertools
import math

raw_input()
coins = sorted([int(x) for x in raw_input().split(" ")])

#def viableFor(money, coinsData):
#    result = []
#    for coin in coinsData:
#        if coin < money:
#            result.append(coin)
#        elif coin == money:
#            return [coin]
#        else:
#            return result
#    return result

def binarize(combinations):
    x = 1
    while 2**x in combinations:
        x = x + 1
    return 2**x

if coins[0] > 1:
    print("1")
else:
    ranke = coins[0]
    broken = False
    for coin in coins[1:]:
        if ranke < coin-1:
            print(ranke+1)
            broken = True
            break
        else:
            ranke = ranke + coin
    if not broken:
        print(ranke+1)
    

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED

Test 16

Group: 3

Verdict: ACCEPTED