from bisect import bisect_left
import sys
input = sys.stdin.readline

class Compress:
    def __init__(self, vs):
        self.xs = list(set(vs))
        self.xs.sort()

    def compress(self, x):
        return bisect_left(self.xs, x)

    def decompress(self, i):
        return self.xs[i]

N = int(input())
A = list(map(int, input().split()))
comp = Compress(A)
A = [comp.compress(x) for x in A]
prv = [N - 1] + list(range(N - 1))
nxt = list(range(1, N)) + [0]
idx = [[] for _ in range(N)]
for i, x in enumerate(A):
    idx[x].append(i)
i = N - 1
ans = 0
for x in sorted(list(set(A)), reverse=True):
    M = len(idx[x])
    j = bisect_left(idx[x], i) % M
    for _ in range(M):
        if i != idx[x][j]:
            i = idx[x][j]
            ans += 1
        nxt[prv[i]] = nxt[i]
        prv[nxt[i]] = prv[i]
        i = prv[i]
        j = (j - 1) % M
print(ans)