#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
const int maxn = 1e5 + 5;
#define mid (l + r >> 1)
int n, tot, ls[maxn * 100], rs[maxn * 100], seg[maxn * 100];
void update(int &p, int l, int r, int s, int t, int val) {
    if (r < s || t < l) return;
    if (!p) seg[p = ++tot] = -1;
    if (seg[p] >= val) return;
    if (s <= l && r <= t) return void(seg[p] = max(seg[p], val));
    update(ls[p], l, mid, s, t, val), update(rs[p], mid + 1, r, s, t, val);
    return;
}
int query(int p, int l, int r, int s, int t) {
    if (r < s || t < l || !p) return -1;
    if (s <= l && r <= t) return seg[p];
    return max(max(query(ls[p], l, mid, s, t), query(rs[p], mid + 1, r, s, t)), seg[p]);
}
#define lp (p << 1)
#define rp (p << 1 | 1)
int rt[maxn << 2];
void modify(int p, int l, int r, int s, int t, int ql, int qr, int val) {
    if (r < s || t < l) return;
    if (s <= l && r <= t) return update(rt[p], 1, n, ql, qr, val);
    modify(lp, l, mid, s, t, ql, qr, val), modify(rp, mid + 1, r, s, t, ql, qr, val);
    return;
}
int query(int p, int l, int r, int pos, int s, int t) {
    if (l == r) return query(rt[p], 1, n, s, t);
    if (pos <= mid) return max(query(rt[p], 1, n, s, t), query(lp, l, mid, pos, s, t));
    else return max(query(rt[p], 1, n, s, t), query(rp, mid + 1, r, pos, s, t));
}
#undef lp
#undef rp
#undef mid
int a[maxn];
int ans, dp[maxn];
int top, stack[maxn], nxt[maxn];
int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) scanf("%d", a + i);
    memset(dp, -1, sizeof(dp));
    dp[0] = 0;
    for (int i = 0; i <= n; i++) {
        if (!(~dp[i])) continue;
        ans = max(ans, dp[i]);
        int j;
        for (j = i + 1; a[i] >= a[j] && j <= n; j++);
        if (j <= n) {
            dp[j] = max(dp[j], dp[i] + 1);
            for (int k = j + 1; a[j] >= a[k] && k <= n; k++) 
                if (a[i] < a[k]) dp[k] = max(dp[k], dp[i] + 1);
        }
    }
    printf("%d\n", ans);
    return 0;
}