#include<iostream>

using namespace std;

const int N = 100010;
/*
贪心思想，q[]数组放单调递增的子序列，有点像单调队列
*/
int n;
int a[N], q[N];

int main()
{
    cin >> n;
    for(int i = 0; i < n; i ++ ) scanf("%d", &a[i]);

    int len = 0;
    for(int i = 0; i < n; i ++ )
    {
        int l = 0, r = len;
        while(l < r)
        {
            int mid = l + r + 1 >> 1;
            if(q[mid] < a[i]) l = mid; // 找到的是最后一个满足q[] < a[i]的位置
            else r = mid - 1;
        }
        q[l + 1] = a[i];
        len = max(len, l + 1);
    }
    cout << len;
    return 0;
}