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

#define GOTTAGOFAST cin.tie(0); ios::sync_with_stdio(0);
typedef pair<int,int> pii;

int main() {

    GOTTAGOFAST

    int n;
    cin >> n;

    int prev = -1, curr, next;
    cin >> curr;

    vector<pii> csucsok;

    for(int i = 1; i < n; i++)
    {
        cin >> next;
        if((curr > prev && curr > next) || (curr == prev && curr > next) || (curr > prev && curr == next))
        {
            csucsok.push_back({curr, i});
        }
        prev = curr;
        curr = next;
    }
    next = -1;
    if((curr > prev && curr > next) || (curr == prev && curr > next) || (curr > prev && curr == next))
    {
        csucsok.push_back({curr, n});
    }

    if(csucsok.size() < 2)
    {
        cout << "0\n";
        return 0;
    }

    if(csucsok.size() == 2)
    {
        cout << csucsok[1].second-csucsok[0].second << "\n";
        return 0;
    }

    int maxl = -1;
    queue<pii*> jocsucsok;
    jocsucsok.push(&csucsok[0]);

    for(int i = 1, j = csucsok.size()-1; i < j; i++)
    {
        if(!(csucsok[i].first < csucsok[i-1].first && csucsok[i].first < csucsok[i+1].first))
            jocsucsok.push(&csucsok[i]);
    }

    jocsucsok.push(&csucsok[csucsok.size()-1]);

    pii* p = jocsucsok.front();
    jocsucsok.pop();

    while(!jocsucsok.empty())
    {
        maxl = max(jocsucsok.front()->second-p->second, maxl);
        p = jocsucsok.front();
        jocsucsok.pop();
    }

    cout << maxl << "\n";

    return 0;
}