#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;

const int MAXN = 1000005;
int n;
vector<int> heights(MAXN);

// Sparse Table
vector<vector<int>> table(MAXN, vector<int>(20));  // 20 ~ log2(MAXN)

// Build the Sparse Table
void build() {
    for(int i = 0; i < n; i++) {
        table[i][0] = i;
    }

    for(int j = 1; (1 << j) <= n; j++) {
        for(int i = 0; i + (1 << j) - 1 < n; i++) {
            if(heights[table[i][j-1]] > heights[table[i + (1 << (j-1))][j-1]]) {
                table[i][j] = table[i][j-1];
            } else {
                table[i][j] = table[i + (1 << (j-1))][j-1];
            }
        }
    }
}

// Query the Sparse Table to get the index of maximum value in range [l, r)
int query(int l, int r) {
    int len = r - l;
    int k = log2(len);
    if(heights[table[l][k]] > heights[table[l + len - (1 << k)][k]]) {
        return table[l][k];
    } else {
        return table[l + len - (1 << k)][k];
    }
}

pair<int, int> compute(int l, int r) {
    if (l >= r) return {-1, -1};
    int m = query(l, r);
    
    pair<int, int> left = compute(l, m);
    pair<int, int> right = compute(m + 1, r);
    
    int diameter = max({left.first, right.first, left.second + right.second + 1}) + 1;
    int height = max(left.second, right.second) + 1;

    return {diameter, height};
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
    cin >> n;
    for(int i = 0; i < n; i++) cin >> heights[i];

    build();  // Build the Sparse Table

    pair<int, int> result = compute(0, n);
    cout << result.first << endl;

    return 0;
}