def jenga_sort(n, a):
    ans = n
    for i in reversed(range(n)):
        if a[i] == ans:
            ans -= 1
    return ans


N = int(input())
A = list(map(int, input().split()))
count = 0

print(jenga_sort(N, A))