#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
using namespace std;
#define ll long long
vector<int> v;
deque<int>q;
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
        
    int n, x;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        cin >> x;
        v.push_back(x);
    }
    int w = 0;
    for (int i = 2*n-1; i >=0; i--)
    {
        while (!q.empty() and q.front() <= v[i % n])
            q.pop_front();
        q.push_front(v[i % n]);
        w = max(w, (int)q.size());
    }
    cout << w;
}