/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define pb push_back
#define ff first
#define ss second
#define isz(x) (int)x.size()
using namespace std;

const int mxN = 1e6 + 5;
const int mod = 1e9 + 7;
const i64 oo = 1e18;

int n, a[mxN];
vector<int> st;
vector<int> G[mxN];
int res, dp[mxN], dp2[mxN];

void dfs(int v) {
    for (int u : G[v]) if (u) {
        dfs(u);
        dp2[v] = max({dp2[v], dp2[u] + 1, dp[v] + dp[u] + 1});
        dp[v] = max(dp[v], dp[u] + 1);
    }
}

void solve() {
    cin >> n;
    for (int i = 1; i <= n; ++i) {
        cin >> a[i];
        G[i].resize(2);
        while (not st.empty() and a[st.back()] < a[i]) {
            G[i][0] = st.back();
            st.pop_back();
        }
        if (not st.empty()) G[st.back()][1] = i;
        st.emplace_back(i);
    }
    dfs(st.front());
    cout << *max_element(dp2 + 1, dp2 + n + 1) << endl;
}

signed main() {

#ifndef CDuongg
    if(fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
   auto end = chrono::high_resolution_clock::now();
   cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
   cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
   cout << "Check array size pls sir" << endl;
#endif

}