#include <fstream>
#include <vector>

using namespace std;

int binarySearch(vector<long long>::iterator begin, vector<long long>::iterator end, long long x)
{
    int left = 0, right = end - begin - 1;


    while (left <= right)
    {
        int mid = left + (right - left) / 2;
        if (*(begin + mid) < x)
            left = mid + 1;
        else
            right = mid - 1;
    }
    if (left < end - begin)
        return left;
    return -1;
}


int main()
{
    ifstream fin("scmax.in");
    ofstream fout("scmax.out");

    int n;
    vector<long long> v, dp, tails;

    fin >> n;

    for (int i = 0; i < n; ++i)
    {
        long long x;
        fin >> x;
        v.push_back(x);
    }

    dp.resize(n + 1, 0);
    tails.push_back(v[0]);

    for (int i = 1; i < n; ++i)
    {
        long long x = v[i];

        int position = binarySearch(tails.begin(), tails.end(), x);
        if (position == -1)
        {
            tails.push_back(x);
            dp[i] = tails.size();
        }
        else
        {
            tails[position] = x;
            dp[i] = position + 1;
        }
    }

    fout << dp[n - 1] << endl;

    return 0;

}