import bisect

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

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

print(n - len(tails))