def lowestPositiveInt(A):
    A.sort()
    index = (- 1)
    try:
        index = A.index(1)
    except ValueError:
        return 1
    A = A[index:]
    length = len(A)
    i = 1
    found = 0
    while ((i < length) and (found == 0)):
        if (A[i] > (A[(i - 1)] + 1)):
            found = (A[(i - 1)] + 1)
        i = (i + 1)
    if (found > 0):
        return found
    else:
        return (A[(length - 1)] + 1)
def lowestPositiveInt(A):
    A.sort()
    index = (- 1)
    try:
        index = A.index(1)
    except ValueError:
        return 1
    A = A[index:]
    length = len(A)
    i = 1
    found = 0
    while ((i < length) and (found == 0)):
        if (A[i] > (A[(i - 1)] + 1)):
            found = (A[(i - 1)] + 1)
        i = (i + 1)
    if (found > 0):
        return found
    else:
        return (A[(length - 1)] + 1)