#include <bits/stdc++.h> using namespace std; const int N = 100005; int n; int a[N], tmp[N]; int bit[N], f[N]; void upt(int u, int val) { while (u <= n) { bit[u] = max(bit[u], val); u += (-u) & u; } } int get(int u) { int k = 0; while (u > 0) { k = max(k, bit[u]); u -= (-u) & u; } return k; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; tmp[i] = a[i]; } sort(tmp + 1, tmp + n + 1); for (int i = 1; i <= n; i++) a[i] = lower_bound(tmp + 1, tmp + n + 1, a[i]) - tmp; int ans = 0; for (int i = 1; i <= n; i++) { f[i] = get(a[i]) + 1; upt(a[i], f[i]); } cout << n - f[n]; return 0; }