#define _CRT_SECURE_NO_WARNINGS
#define inf 1000*1000*1000 + 1
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
vector<int> row;

int log_find(int l, int r, int a)
{
    int M = (l + r + 1) / 2;
    if (row[M - 1] < a && a <= row[M])
        return M;
    else if (row[M - 1] >= a && a < row[M])
        return log_find(l, M - 1, a);
    else return log_find(M + 1, r, a);
}

int main()
{
    int N, size = 0;
    int a;
    scanf("%d", &N);
    row.resize(1, -inf);
    row.resize(N + 1, inf);
    for (int i = 0; i < N; i++)
    {
        scanf("%d", &a);
        int id = log_find(1, i, a);
        int k = 0;
        if (row[id] == inf)
            size++;
        row[id] = min(row[id], a);
    }

    printf("%d", size);

    return 0;
}