class Binary_Indexed_Tree: def __init__(self, n): self.size = n self.tree = [0] * (n + 1) self.depth = n.bit_length() # 配列のi番目までの和 1-indexed def sum(self, i): s = 0 while i > 0: s += self.tree[i] i -= i & -i return s # 区間[l, r)の和 def get_sum(self, l, r): return self.sum(r-1) - self.sum(l-1) # 1-indexed 配列のi番目にxを足す def add(self, i, x): while i <= self.size: self.tree[i] += x i += i & -i def lower_bound(self, x): """ 累積和がx以上になる最小のindexと、その直前までの累積和 """ sum_ = 0 pos = 0 for i in range(self.depth, -1, -1): k = pos + (1 << i) if k <= self.size and sum_ + self.tree[k] < x: sum_ += self.tree[k] pos += 1 << i return pos + 1, sum_ N = int(input()) a = list(map(int, input().split())) BIT = Binary_Indexed_Tree(N) res = 0 for i in range(N): BIT.add(a[i], 1) if BIT.get_sum(a[i]+1, N+1)>0: res += 1 print(res)