import bisect

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