n = int(input())
a = list(map(int, input().split()))
sorted_pairs = sorted((val, idx) for idx, val in enumerate(a))
original_pos = [pair[1] for pair in sorted_pairs]

required_tools = set()
i = 0
while i < n:
    if original_pos[i] <= i:
        i += 1
        continue
    # Start of a new segment
    max_m = original_pos[i]
    start = i
    while i < n and original_pos[i] > i:
        if original_pos[i] > max_m:
            max_m = original_pos[i]
        i += 1
    required_tools.add(max_m + 1)

print(len(required_tools))