#include<bits/stdc++.h>

using namespace std;

const int maxn =  + ;

int a[maxn];

int dp[maxn];

int n;

void solve(){

    memset(dp, , sizeof(dp));

    stack <pair<int, int> > s;

    s.push(make_pair(n - , a[n - ]));

    for (int i = n - ; i >= ; i--){

        int t = ;

        pair <int, int> p;

        while (!s.empty() && s.top().second < a[i]){

            p = s.top();

            t = max(dp[p.first], t + );

            s.pop();

        }

        s.push(make_pair(i, a[i]));

        dp[i] = t;

    }

    int cnt = ;

    for (int i = ; i < n; i++) cnt = max(cnt, dp[i]);

    cout << cnt << endl;

}

int main(){

    while (scanf("%d", &n) == ){

        for (int i = ; i < n; i++) scanf("%d", a + i);

        solve();

    }

    return ;

}