#include <iostream>
using namespace std;
int N;
int H[100000];
int ms = 0, me, mns;
int maxwidth = 0;
int main(){
cin >> N;
for (int i = 0; i < N; i++)
cin >> H[i];
int i = 0;
while (i < N){
int dH = H[i+1] - H[i];
while (dH >= 0 && i < N){
i++;
dH = H[i+1] - H[i];
}
//reached peak
while (dH <= 0 && i < N){
if (dH < 0)
mns = i+1;
i++;
dH = H[i+1] - H[i];
}
if (i == N){
maxwidth = max(maxwidth, i-ms);
//cout << "mountain from " << ms << " to " << i-1 << "\n";
}
else{
maxwidth = max(maxwidth, i-ms+1);
//cout << "mountain from " << ms << " to " << i << "\n";
}
ms = mns;
//reached start of next peak
}
cout << maxwidth << "\n";
}
I2luY2x1ZGUgPGlvc3RyZWFtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBOOwppbnQgSFsxMDAwMDBdOwppbnQgbXMgPSAwLCBtZSwgbW5zOwppbnQgbWF4d2lkdGggPSAwOwoKaW50IG1haW4oKXsKCiAgICBjaW4gPj4gTjsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgTjsgaSsrKQogICAgICAgIGNpbiA+PiBIW2ldOwoKICAgIGludCBpID0gMDsKICAgIHdoaWxlIChpIDwgTil7CiAgICAgICAgaW50IGRIID0gSFtpKzFdIC0gSFtpXTsKICAgICAgICB3aGlsZSAoZEggPj0gMCAmJiBpIDwgTil7CiAgICAgICAgICAgIGkrKzsKICAgICAgICAgICAgZEggPSBIW2krMV0gLSBIW2ldOwogICAgICAgIH0KICAgICAgICAvL3JlYWNoZWQgcGVhawogICAgICAgIHdoaWxlIChkSCA8PSAwICYmIGkgPCBOKXsKICAgICAgICAgICAgaWYgKGRIIDwgMCkKICAgICAgICAgICAgICAgIG1ucyA9IGkrMTsKICAgICAgICAgICAgaSsrOwogICAgICAgICAgICBkSCA9IEhbaSsxXSAtIEhbaV07CiAgICAgICAgfQogICAgICAgIGlmIChpID09IE4pewogICAgICAgIAltYXh3aWR0aCA9IG1heChtYXh3aWR0aCwgaS1tcyk7CiAgICAgICAgCS8vY291dCA8PCAibW91bnRhaW4gZnJvbSAiIDw8IG1zIDw8ICIgdG8gIiA8PCBpLTEgPDwgIlxuIjsKICAgICAgICB9CiAgICAgICAgZWxzZXsKICAgICAgICAJbWF4d2lkdGggPSBtYXgobWF4d2lkdGgsIGktbXMrMSk7CiAgICAgICAgCS8vY291dCA8PCAibW91bnRhaW4gZnJvbSAiIDw8IG1zIDw8ICIgdG8gIiA8PCBpIDw8ICJcbiI7CiAgICAgICAgfQogICAgICAgIG1zID0gbW5zOwogICAgICAgIC8vcmVhY2hlZCBzdGFydCBvZiBuZXh0IHBlYWsKICAgIH0KCiAgICBjb3V0IDw8IG1heHdpZHRoIDw8ICJcbiI7Cgp9Cg==