// 那就是希望。
// 即便需要取模，也是光明。

#include <algorithm>
#include <stdio.h>
#include <vector>
typedef long long llt;
typedef unsigned uint;typedef unsigned long long ullt;
typedef bool bol;typedef char chr;typedef void voi;
typedef double dbl;
template<typename T>bol _max(T&a,T b){return(a<b)?a=b,true:false;}
template<typename T>bol _min(T&a,T b){return(b<a)?a=b,true:false;}
template<typename T>T lowbit(T n){return n&-n;}
template<typename T>T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<typename T>T lcm(T a,T b){return(a!=0||b!=0)?a/gcd(a,b)*b:(T)0;}
template<typename T>T exgcd(T a,T b,T&x,T&y){if(b!=0){T ans=exgcd(b,a%b,y,x);y-=a/b*x;return ans;}else return y=0,x=1,a;}
template<typename T>T power(T base,T index,T mod)
{
    T ans=1%mod;
    while(index)
    {
        if(index&1)ans=ans*base%mod;
        base=base*base%mod,index>>=1;
    }
    return ans;
}
// Heaven and Earth... My guiding star...
// Akira Complex R.I.P.
uint A[45],L[45],R[45],n,m,ans;
voi dfs(uint p,uint s1,uint s2,uint wil)
{
    if(p==m)_min(ans,wil);
    if(wil>=ans)return;
    uint c1r=__builtin_popcount(s1>>R[p]),c1l=__builtin_popcount(s1>>L[p]);
    uint c2r=__builtin_popcount(s2>>R[p]),c2l=__builtin_popcount(s2>>L[p]);
    dfs(p+1,s1|1u<<R[p],s2,wil+std::min<uint>(c1l-c1r,c2l+c1r));
    dfs(p+1,s1,s2|1u<<R[p],wil+std::min<uint>(c2l-c2r,c1l+c2r));
}
voi solve()
{
    scanf("%u",&n),m=0;for(uint i=0;i<n;i++)A[i]=R[i]=-1;
    for(uint i=0,v;i<n;i++){scanf("%u",&v);if(~A[--v])R[A[v]]=i;else A[v]=i;}
    for(uint i=0;i<n;i++)A[i]=0;
    for(uint i=0;i<n;i++)if(~R[i])A[R[i]]=1;
    for(uint i=1;i<n;i++)A[i]+=A[i-1];
    for(uint i=0;i<n;i++)if(~R[i])L[m]=A[i],R[m++]=A[R[i]-1];
    if(m<=1){puts("0");return;}
    ans=-1,dfs(1,1u<<R[0],0,0),printf("%u\n",ans);
}
int main()
{
#ifdef MYEE
    freopen("QAQ.in","r",stdin);
    freopen("QAQ.out","w",stdout);
#endif
    uint t;scanf("%u",&t);
    while(t--)solve();
    return 0;
}

// 那就是希望。
// 即便需要取模，也是光明。