#include<bits/stdc++.h> using namespace std; int a[400005]; int d[400005]; int main() { int n; cin>>n; for (int i=1;i<=n;i++) cin>>a[i]; d[1]=a[1]; int len=1; for (int i=2;i<=n;i++) { if (a[i]>=d[len]) d[++len]=a[i]; else { int j=upper_bound(d+1,d+len+1,a[i])-d; d[j]=a[i]; } } cout<<len; return 0; }