// Subsir crescator de lungime maxima in O(NlogN)
#include <iostream>
using namespace std;
const int mxN = 2e5, INF = 2e9;
// dp[i] - cea mai mica valoare in care se termina un subsir crescator de lungime i
int v[mxN+10], dp[mxN+10];
int main()
{
int n ;
cin >> n ;
dp[0] = -INF;
for(int i = 1;i<=n;i++)
cin >> v[i], dp[i] = INF;
for(int poz = 1;poz<=n;poz++)
{
int st = 0, dr = n-1 , mid, sol = -1;
while(st <= dr)
{
mid = (st + dr) / 2;
if(v[poz] <= dp[mid])
dr = mid-1;
else st = mid+1, sol = mid;

}
dp[sol+1] = min(dp[sol+1],v[poz]);
}
int sol = 0;
for(int i = 1;i<=n;i++)
{
if(dp[i] != INF)
sol = i;
else break;
}
cout << sol << '\n';
return 0;
}