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

#define ll long long
#define st first
#define nd second
#define ld long double

void solve() {
    int n;
    cin >> n;
    deque<int> a;
    int m = 0;
    for (int i = 0; i < n; i++) {
        int x;
        cin >> x;
        m = max(m, x);
        a.push_back(x);
    }
    while (a.back() != m) {
        int x = a.back();
        a.pop_back();
        a.push_front(x);
    }
    int ans = 0;
    stack<int> s;
    while (!a.empty()) {
        int x = a.back();
        a.pop_back();
        while (!s.empty() && x >= s.top()) {
            s.pop();
        }
        s.push(x);
        ans = max(ans, (int)s.size());
    }
    cout << ans << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin >> t;
    for (int i = 0; i < t; i++) {
        solve();
    }
}