import bisect

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