from collections import *
from heapq import *

class QuasiBinaryTree:
    def __init__(self, rule="min"):
        if rule == "max":
            self.pm = -1
        else:
            self.pm = 1
 
        self.inf = 10**18
        self.P = [self.inf]
        self.Q = []
 
    def insert(self, x):
        heappush(self.P, x * self.pm)
 
    def erase(self, x):
        heappush(self.Q, x * self.pm)
 
    def top(self):
        while self.Q and (self.P[0] == self.Q[0]):
            heappop(self.P)
            heappop(self.Q)
        return self.P[0] * self.pm

N = int(input())
A = list(map(int, input().split()))
A.reverse()
D = defaultdict(list)
for i in range(N):
    D[A[i]].append(i)

for k, v in D.items():
    D[k].reverse()

L = []
A.sort()
for i in range(N - 1, -1, -1):
    L.append(D[A[i]].pop())

H = QuasiBinaryTree("min")
H2 = QuasiBinaryTree("min")
for i in range(N):
    H.insert(i)
    H2.insert(i)

ans = 0
pre = -1
flag = 0
for i in range(N):
    if L[i] != pre + 1 and (L[i] != H.top() or flag):
        ans += 1
    pre = L[i]
    if pre == H2.top():
        flag = 1
    else:
        flag = 0
    H.erase(L[i])
    H2.erase(L[i])

print(ans)