#include<bits/stdc++.h> using namespace std; int n,a[10005],f[10005],top=0; int g(int x) { int l=1,r=top,res=0; while(l<=r) { int mid=(l+r)/2; if(f[mid]>x) { r=mid-1; res=mid; } else { l=mid+1; } } return res; } int main() { cin>>n; for(int i=1;i<=n;i++)cin>>a[i]; for(int i=1;i<=n;i++) { if(a[i]>=f[top])f[++top]=a[i]; else f[g(a[i])]=a[i]; } cout<<top; return 0; }