# Arup Guha
# 12/15/2024
# Solution to Kattis Problem: Pivot
# https://open.kattis.com/problems/pivot

# Get input.
n = int(input())
vals = [int(x) for x in input().split()]

# Do maxes from left.
mymaxs = [0]*n
mymaxs[0] = vals[0]
for i in range(1,n):
    mymaxs[i] = max(vals[i], mymaxs[i-1])

# Do mins from right.
mymins = [0]*n
mymins[n-1] = vals[n-1]
for i in range(n-2,-1,-1):
    mymins[i] = min(vals[i], mymins[i+1])

# We're looking for max from left = min from right
res = 0
for i in range(n):
    if mymaxs[i] == mymins[i]:
        res += 1

# Ta da!
print(res)