import bisect

n = int(input())
A = list(map(int, input().split()))

tail = []
for x in A:
    idx = bisect.bisect_left(tail, x)
    if idx == len(tail):
        tail.append(x)
    else:
        tail[idx] = x

print(n - len(tail))