#include <iostream>
#include <fstream>
#include <cstring>

using namespace std;

ifstream in("scmax.in");
ofstream out("scmax.out");

const int INF = 1e9;
int n;
int v[100100], small[100100];
pair<int, int> best[100100];

int binarySearch(int value)
{
    int l = 1, r = n, mid;

    while(l <= r)
    {
        mid = (l + r) / 2;

        if(small[mid] < value)
            l = mid + 1;
        else
            r = mid - 1;
    }

    return mid;
}

int main()
{
    in >> n;

    for(int i = 1; i <= n; i++)
        in >> v[i];

    for(int i = 0; i <= n; i++)
        small[i] = INF;

    best[1].first = 1;
    small[1] = v[1];


    for(int i = 2; i <= n; i++)
    {
        best[i].first = 1;

        for(int j = n; j > 0; j--)
        {
            if(small[j] < v[i])
            {
                best[i].first = j + 1;
                break;
            }
        }

        if(small[best[i].first] > v[i])
            small[best[i].first] = v[i];
    }

    out << best[n].first << '\n';

    return 0;
}