#include <bits/stdc++.h> using namespace std; int n,a[100001],q[100001],ans; int main() { cin>>n; for(int i=1;i<=n;i++) { cin>>a[i]; if(i==1) q[++ans]=a[i]; else { if(a[i]<q[ans]) q[upper_bound(q,q+ans,a[i])-q]=a[i]; else q[++ans]=a[i]; } } cout<<ans; }