#include <bits/stdc++.h>

using namespace std;

const int lim = 2000;

vector<int> arr;
vector<int> len;
vector<bool> ready;

int length(int x)
{
    if (x == 0) return 1;
    int i = 0;
    int l = 0;
    int m = 0;
    while (i < x)
    {
        if (m < arr[i])
        {
            if (!ready[i])
                len[i] = max(l, length(i) + 1);
            l = len[i];
            m = arr[i];
        }

        i++;
    }

    len[x] = l;
    ready[x] = 1;
    
    return l;
}

int main()
{
    int n;
    cin >> n;

    arr.resize(n);
    len.resize(n);
    ready.resize(n);
    for (int i = 0; i < n; i++)
    {
        cin >> arr[i];
    }

    int l = length(n - 1);
    cout << l;

    return 0;
}