#include <bits/stdc++.h>

using namespace std;

/**


 dp[i] = max(dp[j] + 1, dp[i]), j < i, a[j] < i



 aib[] =
 Query(a[i] - 1);
 Update(a[i], dp[i]);

*/

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

int n;
int a[100005];

pair <int ,int> b[100005];

int aib[100005], dp[100005];


void Update(int poz, int val) {
    for (int i = poz; i <= n; i += (i & -i))
        aib[i] = max(aib[i], val);
}

int Query (int poz) {
    int val = 0;
    for (int i = poz; i > 0; i -= (i & -i))
        val = max(val, aib[i]);
    return val;
}

int main()
{
    fin >> n;
    for (int i = 1; i <= n; i++)
        fin >> a[i], b[i] = {a[i], i};
    sort(b + 1, b + n + 1);
    int val = 1;
    a[b[1].second] = 1;
    for (int i = 2; i <= n; i++) {
        if (b[i].first != b[i - 1].first)
            val++;
        a[b[i].second] = val;
    }
    int ans = 1;
    for (int i = 1; i <= n; i++) {
        dp[i] = max(dp[i], Query(a[i] - 1) + 1);
        Update(a[i], dp[i]);
        ans = max(ans, dp[i]);
    }
    fout << ans << "\n";

    return 0;
}