#include <bits/stdc++.h>
using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(NULL);

    int n, tmp;
    cin >> n;
    vector<int> a;
    for (int i = 0; i < n; i++) {
        cin >> tmp;
        a.push_back(tmp);
    }

    for (int i = 0; i < n; i++) {
        a.push_back(a[i]);
    }

    n <<= 1;
    deque<int> deque;
    int dp[n];
    int res = 0;
    for (int i = n - 1; i >= 0; --i) {
        while (!deque.empty() && a[deque.back()] <= a[i]) {
            deque.pop_back();
        }
        dp[i] = deque.empty() ? 1 : dp[deque.back()] + 1;
        res = max(res, dp[i]);
        deque.push_back(i);
    }
    cout << res << endl;
    return 0;
}