#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int n;
int a[112345], dp[112345];

int main() {
	cin >> n;
	REP(i, n) scanf("%d", a + i);
	
	fill(dp, dp + n, 0);
	
	reverse(a, a + n);
	REP(i, n) a[i] = -a[i];
	
	bool f = false;
	REP(i, n) {
		if (a[i] == -n) f = true;
		
		if (f) *lower_bound(dp, dp + n, a[i]) = a[i];
	}
	
	int ans = 0;
	REP(i, n) if (dp[i] != 0) ans = i + 1;
	
	cout << n - ans << endl;
	
	return 0;
}