n = int(input())
a = list(map(int, input().split()))
elements = [(a[i], i + 1) for i in range(n)]  # (value, original 1-based index)
elements.sort(key=lambda x: (x[0], x[1]))  # stable sort by value, then by original index
pos = [e[1] for e in elements]

max_pos = n
count = 0

for i in range(n-1, -1, -1):
    current_pos = pos[i]
    if current_pos > max_pos:
        count += 1
        max_pos = current_pos
    else:
        if current_pos < max_pos:
            max_pos = current_pos

print(count)