#include
using namespace std;
int bitonicsum(int arr[],int n){
int max;
int inc[n];
inc[0]=1;
int dec[n];
inc[n-1]=1;
for(int i=1;i<n;i++){
inc[i]=(arr[i]>=arr[i-1])? inc[i-1] + 1: 1;
}
for (int i = n-2; i >= 0; i--){
dec[i] = (arr[i] >= arr[i+1])? dec[i+1] + 1: 1;
}
max = inc[0] + dec[0] - 1;
for (int i = 1; i < n; i++)
if (inc[i] + dec[i] - 1 > max)
max = inc[i] + dec[i] - 1;
return max;
}
int main(){
int test;
cin>>test;
int count=0;
while(count<test){
int n;
cin>>n;
int arr[n];
for(int i=0;i<n;i++){
cin>>arr[n];
}
cout<<bitonicsum(arr,n)<<endl;
count++;
if(count==test){
break;
}
}
return 0;
}