import bisect

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

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

print(n - len(dp))