#include<iostream>

 #include<algorithm>

 using namespace std;

 const int maxn =  *  + ;

 int n;

 int a[maxn];

 int f[maxn], g[maxn],d[maxn];

 int main()

 {

     //freopen("D:\\txt.txt", "r", stdin);

     int t;

     cin >> t;

     while (t--)

     {

         cin >> n;

         for (int i = ; i <= n; i++)

             cin >> a[i];

         f[] = ;

         for (int i = ; i <= n; i++)

             f[i] = a[i] > a[i - ] ? f[i - ] +  : ;

         g[n] = ;

         for (int i = n - ; i >= ; i--)

             g[i] = a[i] < a[i + ] ? g[i + ] +  : ;

         int ans = ;

         for (int i = ; i <= n; i++)

             d[i] =  << ;

         for (int i = ; i <= n; i++)

         {

             //low_bound的返回值就是以a[i]为尾的连续递增子序列

             int len = (lower_bound(d +  , d +  + i , a[i]) - (d + )) + g[i];

             ans = max(len, ans);

             d[f[i]] = min(a[i], d[f[i]]); //如果以i结尾的最大连续递增子序列个数相同，那么选择数小的

         }

         cout << ans << endl;

     }

     return ;

 }