// https://w...content-available-to-author-only...j.com/problems/ELIS/



#include <bits/stdc++.h>



using namespace std;

bool isIncreasing(vector<int> v) {
    for (int i = 0; i < v.size() - 1; ++i) {
        if (v[i] >= v[i + 1])
            return false;
    }
    return true;
}

int main() {
//    freopen("input.txt", "r", stdin);
//    www.spoj.com/problems/ELIS/
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int n;
    cin >> n;

    vector<int> v(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }
    int ans = 0;
    for (int mask = 1; mask < (1 << n); ++mask) {
        vector<int> subset;
        for (int i = 0; i < n; ++i) {
            if (mask & (1 << i)) {
                subset.push_back(v[i]);
            }
        }
        if (isIncreasing(subset) && subset.size() > ans) {
            ans = subset.size();
        }
    }
    cout << ans;

}