// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in Java SE 8
    }
}

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(A):
    # write your code in Python 3.6
    pass

def solution(A):

    max_num = 0

    for i in A:
        max_num = max(max_num, i)
    
    compare_set = set([i for i in range(1, max_num + 1)])
    a_set = set(A)

    compare_list = list(compare_set - a_set)
    if compare_list:
        return max(compare_list)
    elif max_num > 0:
        return max_num + 1
    else:
        return 1 

def solution(A):

    max_num = 0

    for i in A:
        max_num = max(max_num, i)
    
    compare_set = set([i for i in range(1, max_num + 1)])
    a_set = set(A)

    compare_list = list(compare_set - a_set)
    if compare_list:
        return max(compare_list)
    elif max_num > 0:
        return max_num + 1
    else:
        return 1 

def solution(A):

    max_num = 0

    for i in A:
        max_num = max(max_num, i)
    
    compare_set = set([i for i in range(1, max_num + 1)])
    a_set = set(A)

    compare_list = list(compare_set - a_set)
    if compare_list:
        return max(compare_list)
    elif max_num > 0:
        return min
    else:
        return 1 

def solution(A):

    max_num = 0

    for i in A:
        max_num = max(max_num, i)
    
    compare_set = set([i for i in range(1, max_num + 1)])
    a_set = set(A)

    compare_list = list(compare_set - a_set)
    if compare_list:
        return max(compare_list)
    elif max_num > 0:
        return max_num + 1
    else:
        return 1 

def solution(A):

    max_num = 0

    for i in A:
        max_num = max(max_num, i)
    
    compare_set = set([i for i in range(1, max_num + 1)])
    a_set = set(A)

    compare_list = list(compare_set - a_set)
    if compare_list:
        return min(compare_list)
    elif max_num > 0:
        return max_num + 1
    else:
        return 1 

def solution(A):

    max_num = 0

    for i in A:
        max_num = max(max_num, i)
    
    compare_set = set([i for i in range(1, max_num + 1)])
    a_set = set(A)

    compare_list = list(compare_set - a_set)
    if compare_list:
        return min(compare_list)
    elif max_num > 0:
        return max_num + 1
    else:
        return 1 

def solution(A):

    max_num = 0

    for i in A:
        max_num = max(max_num, i)
    
    compare_set = set([i for i in range(1, max_num + 1)])
    a_set = set(A)

    compare_list = list(compare_set - a_set)
    if compare_list:
        return min(compare_list)
    elif max_num > 0:
        return max_num + 1
    else:
        return 1