#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
class solution
{
public:
void getInput()
{
int N;
cin >> N;
vector<int> A;
getArray(A,N);
vector<int> incr(N,0);
vector<int> decr(N,0);
incr[0] = 1;
decr[N-1] = 1;
for(int i = 1 ; i < N ; i++)
{
incr[i] = ((A[i] >= A[i-1]) ? incr[i-1] + 1 : 1);
}
//printArray(incr);
for(int i = N - 2 ; i >= 0 ; i--)
{
decr[i] = ((A[i] >= A[i+ 1]) ? decr[i+1] + 1 : 1);
}
//printArray(decr);
int answer = incr[0] + decr[0] - 1;
for(int i = 1 ; i < N ; i++)
{
answer = max(answer, incr[i] + decr[i] - 1);
}
cout << answer << endl;
}
void getArray(vector<int> &A, int N)
{
for(int i = 0 ; i < N ; i++)
{
int val;
cin >> val;
A.push_back(val);
}
}
void printArray(vector<int> &A)
{
for(auto c: A)
{
cout << c << " ";
}
cout << endl;
}
};
int main()
{
int t;
cin >> t;
// int i = 1;
while(t--)
{
// cout << "Test Case " << i << endl;
solution Solution;
Solution.getInput();
// i++;
}
return 0;
}
