import bisect

n = int(input())
a = list(map(int, input().split()))
d = []
for x in a:
    idx = bisect.bisect_left(d, x)
    if idx == len(d):
        d.append(x)
    else:
        d[idx] = x
print(n - len(d))