#include <iostream>
#include <algorithm>

using namespace std;

const int N = 100010;

int n;
int a[N];
int q[N];

int main()
{
    scanf("%d", &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) //找到已存序列中小于a[i]的最大值的下一个位置进行替换 
        {
            int mid = l + r + 1 >> 1;
            if (q[mid] < a[i]) l = mid;
            else r = mid - 1;
        }
        len = max(len, r + 1); //如果是在尾部更新加长的话更新len
        q[r + 1] = a[i]; //把已组好的序列中值更新为更小更紧密的值
    }

    printf("%d\n", len);

    return 0;
}