import bisect

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

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

print(n - len(tails))