# Arup Guha
# 7/16/2025
# Planting Trees
# https://open.kattis.com/problems/plantingtrees

# Read values, sort in reverse order.
n = int(input())
vals = [int(x) for x in input().split()]
vals.sort(reverse=True)

# Now, just take the max of when each tree is ready.
res = 0
for i in range(n):
    res = max(res, vals[i] + i + 2)
print(res)