#include<bits/stdc++.h>
using namespace std;

const int nmax=1e6+42;

int n;

pair<int,int> inp[nmax];

int tree[nmax];

int query(int node,int l,int r,int lq,int rq)
{
    if(l==lq&&r==rq)return tree[node];

    int av=(l+r)/2;

    int ret=0;

    if(lq<=av)ret=max(ret,query(node*2,l,av,lq,min(av,rq)));
    if(av<rq)ret=max(ret,query(node*2+1,av+1,r,max(av+1,lq),rq));

    return ret;
}

void update(int node,int l,int r,int pos,int val)
{
    tree[node]=max(tree[node],val);

    if(l==r)return;

    int av=(l+r)/2;

    if(pos<=av)update(node*2,l,av,pos,val);
    else update(node*2+1,av+1,r,pos,val);
}

int solve()
{
    scanf("%i",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%i",&inp[i].first);
        inp[i].second=i;
    }

    sort(inp+1,inp+n+1);

    for(int i=1;i<=4*n+4;i++)tree[i]=0;

    for(int i=1;i<=n;i++)
    {
        int j=i;
        while(j<=n&&inp[i].first==inp[j].first)j++;

        j--;

        for(int k=j-1;k>=i;k--)
        {
            update(1,0,n,inp[k+1].second,query(1,0,n,0,inp[k].second-1)+1);
        }

        i=j;
    }

    return tree[1];
}

int main()
{
    freopen("stairway.in","r",stdin);
    freopen("stairway.out","w",stdout);

    int t;
    scanf("%i",&t);

    while(t)
    {
        t--;
        printf("%i\n",2*solve());
    }

    return 0;
}
/*
3
7
1 1 1 2 3 3 4
6
1 2 3 4 5 6
10
3 3 2 2 1 1 2 2 3 3


4
0
6

*/