#include <bits/stdc++.h>
# define endl            '\n'
# define clr(x,a)        memset(x,a,sizeof(x))
# define PI              3.14159265358979323846
# define vi              vector<int>
# define fo(i,n)         for(int i=1;i<=n;i++)
# define all(a)          a.begin(), a.end()
# define deb(x)          cout<<#x<<"=="<<x<<endl;
# define pb              push_back
# define sc              scanf
# define pr              printf
# define tc              int t; cin>>t; while(t--)
# define rev(s)          reverse(s.begin(),s.end())
# define linija          cout<<"____________\n";

using namespace std;
typedef long long ll;

const int mxN=100005, mod=1e9+7;
int n, a[mxN], br;
int tail[mxN];
int CeilIndex(int l, int r, int key){
    while (r >= l) {
        int mid = l + (r - l) / 2;
        if (tail[mid] >= key)
            r = mid-1;
        else
            l = mid+1;
    }
    return r;
}

int LongestIncreasingSubsequenceLength(){
   if (br==0) return 0;
   int length = 2; // always points empty slot in tail

   tail[1] = a[1];
   for (int i = 2; i <= br; i++) {
      if (a[i] < tail[1])
         tail[1] = a[i];
      else if (a[i] > tail[length - 1])
         tail[length++] = a[i];
      else{
//         cout<<a[i]<<" ";
//         cout<<"indeks=="<<CeilIndex(1, length - 1, a[i])<<endl;
         tail[CeilIndex(1, length - 1, a[i])+1] = a[i];
      }
    }

    return length-1;
}
int main(){
   freopen("stairway.in", "r", stdin);
   freopen("stairway.out", "w", stdout);
   tc{
      sc("%d", &n);
      a[n+1]=-23;
      for(int i=1; i<=n; i++) sc("%d", &a[i]);
      br=0;
      for(int i=1; i<=n; i++){
         if(a[i]!=a[i+1]) continue;
         while(a[i]==a[i+1] && i<n) i++;
         br++;
         a[br]=a[i];
      }
//      for(int i=1; i<=br; i++) cout<<a[i]<<" ";
//      cout<<endl;
      pr("%d\n", 2*LongestIncreasingSubsequenceLength());
//      linija;
   }

	return 0;
}