#include <bits/stdc++.h>
using namespace std;
#define ll long long
// Function to find length of Longest Bitonic Subarray in an array
void findBitonicSubarray(ll int A[],ll int n)
{
ll int max_len = 0;
ll int i = 0;
while(i+1<n)
{
ll int len = 1;
int k=i;
int j=i;
while (i+1<n && A[i] <= A[i + 1])
{ i++, len++;}
while (i+1<n && A[i] >= A[i + 1])
{ i++, len++; }
if (len > max_len)
max_len = len;
len=1;
while (k+1<n && A[k] >= A[k + 1])
{ k++, len++; }
while (k+1<n && A[k] <= A[k + 1])
{ k++, len++;}
if (len > max_len){
max_len = len;
}
i=j+1;
}
cout<<max_len<<endl;
}
int main()
{
ll int t;
cin>>t;
while(t–){
ll int n,a[1000000];
cin>>n;
for(ll int i=0;i<n;i++)
cin>>a[i];
findBitonicSubarray(a, n);
}
return 0;
}