#include <iostream>
#include <vector>
using namespace std;
int ans = 0;
void solve(vector<int>& tar) {
    if (tar.size() <= 1)return;
    ans++;
    int s = tar.size();
    vector<int>next;
    for (int i = 0; i < s; i++) {
        int l = (i - 1 + s) % s,r = (i+1+s)%s;
        if (tar[i] < tar[l] || tar[i] < tar[r]) {
            continue;
        }
        else {
            next.push_back(tar[i]);
        }
    }
    solve(next);
}
int main()
{
    int n;
    cin >> n;
    vector<int>ok;
    for (int i = 0; i < n; i++) {
        int temp;
        cin >> temp;
        ok.push_back(temp);
    }
    solve(ok);
    cout << ans;
    return 0;
}