#include<bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
    int n; cin >> n;
    vector<int> a(n);
    vector<int> cur(n);
    for(int i = 0; i < n; ++ i) {
        cin >> a[i]; cur[i] = a[i];
    }
    int cnt = 0;
    while (1) {
        // cerr << "Now cur : ";
        // for(int i = 0; i < cur.size(); ++ i)
        //     cerr << cur[i] << " ";
        // cerr << "\n";
        vector<int> label; label.resize(cur.size()); 
        label[0] = 0;
        for(int i = 1; i < cur.size(); ++ i) {
            label[i] = 0;
            if (cur[i] > cur[i - 1]) {
                label[i - 1] = 1;
            } else {
                label[i] = 1;
            }
        }
        vector<int> nxt; 
        for(int i = 0; i < cur.size(); ++ i)
            if (label[i] == 0) 
                nxt.push_back(i);
        // cerr << "Now nxt : ";
        // for(int i = 0; i < nxt.size(); ++ i)
        //     cerr << nxt[i] << " ";
        // cerr << "\n";
        if (nxt.size() <= 1) break;
        cur = nxt; ++ cnt; 
    }
    cout << cnt + 1 << "\n";
    return;
}
signed main() {
    ios::sync_with_stdio(false);
    cout.tie(0), cin.tie(0);
    int T = 1;
    // cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}