#include<bits/stdc++.h>
#define endl "\n"
#define int long long
using namespace std;
using ll = long long;
const int maxn = 2e5 + 10;
const int mod = 998244353;
const int p = 13331;
ll arr[maxn];
unsigned long long f[maxn],pw[maxn];
ll z[maxn],ans[maxn],add=0,ctr[maxn];
vector<int> pidx[maxn],sidx[maxn];
struct Fenwick
{
    static const int maxn = 2e5 + 10;
    static const int N = 2e5 + 3;
    int h[maxn],clk[maxn],CLK;
    int lowbit(int x)
    {
        return x&-x;
    }
    void update(int idx,int k)
    {
        if(!idx)
        {
            h[0]+=k;
            return;
        }
        while(idx<=N)
        {
            if(clk[idx]!=CLK)
            {
                clk[idx]=CLK;
                h[idx]=0;
            }
            h[idx]+=k;
            idx+=lowbit(idx);
        }
    }
    ll query(ll idx)
    {
        if(idx<0)
        {
            return 0;
        }
        ll res=h[0];
        while(idx)
        {
            if(clk[idx]==CLK)
            {
                res+=h[idx];
            }
            idx-=lowbit(idx);
        }
        return res;
    }
    ll query(ll l,ll r)
    {
        return query(r)-query(l-1);
    }
    void clear(void)
    {
        CLK++;
        h[0]=0;
    }
}psum,pcnt,pchg,ssum,scnt;
void init(int n)
{
    for(int i=0;i<=n+1;i++)
    {
        z[i]=ans[i]=ctr[i]=0;
        pidx[i].clear();
        sidx[i].clear();
    }
    psum.clear();
    pcnt.clear();
    pchg.clear();
    ssum.clear();
    scnt.clear();
}
unsigned long long gethash(int l,int r)
{
    if(l>r)
    {
        return 0;
    }
    return f[r]-f[l-1]*pw[r-l+1];
}
bool same(int l1,int r1,int l2,int r2)
{
    if(l1>r1||l2>r2||(r1-l1+1)!=(r2-l2+1))
    {
        return false;
    }
    return gethash(l1,r1)==gethash(l2,r2);
}
void solve(void)
{
    int n;
    cin>>n;
    init(n);
    pw[0]=1;
    for(int i=1;i<=n;i++)
    {
        cin>>arr[i];
        pw[i]=pw[i-1]*p;
        f[i]=(f[i-1]*p+arr[i]);
    }
    for(int i=1;i<=n;i++)
    {
        int l=0,r=n-i+1;
        while(l<r)
        {
            int mid=(l+r+1)>>1;
            if(same(1,mid,i,i+mid-1))
            {
                l=mid;
            }
            else
            {
                r=mid-1;
            }
        }
        z[i]=r;
    }
    for(int i=1;i<=n;i++)
    {
        ssum.update(z[i],z[i]);
        scnt.update(z[i],1);
        sidx[z[i]].emplace_back(i);
    }
    for(int i=1;i<=n;i++)
    {
        ssum.update(z[i],-z[i]);
        scnt.update(z[i],-1);
        if(i>1)
        {
            psum.update(i+z[i],z[i]);
            pcnt.update(i+z[i],1);
            pchg.update(i+z[i],-i);
            pidx[i+z[i]].emplace_back(i);
        }
        ans[i]=n+psum.query(i-1)+ssum.query(i-2)+(scnt.query(i,n+1)*(i-1))+(i*pcnt.query(i+1,n+1)+pchg.query(i+1,n+1));
        vector<int> vec;
        ll mx=0;
        add=0;
        for(const auto& idx : pidx[i])
        {
            int l=z[idx]+1,r=n-idx+1;
            while(l<r)
            {
                int mid=(l+r+1)>>1;
                if(mid>=i)
                {
                    if(((gethash(1,i-1)*pw[mid-(i-1)]+arr[z[idx]+1]*pw[mid-i])+gethash(i+1,mid))==((gethash(idx,idx+z[idx]-1)*pw[mid-z[idx]]+arr[z[idx]+1]*pw[mid-z[idx]-1])+gethash(idx+z[idx]+1,idx+mid-1)))
                    {
                        l=mid;
                    }
                    else
                    {
                        r=mid-1;
                    }
                }
                else
                {
                    if(gethash(1,mid)==((gethash(idx,idx+z[idx]-1)*pw[mid-z[idx]]+arr[z[idx]+1]*pw[mid-z[idx]-1])+gethash(idx+z[idx]+1,idx+mid-1)))
                    {
                        l=mid;
                    }
                    else
                    {
                        r=mid-1;
                    }
                }
            }
            add+=z[idx];
            vec.emplace_back(arr[z[idx]+1]);
            if(arr[z[idx]+1]!=arr[i])
            {
                vec.emplace_back(arr[z[idx]+1]);
                ctr[arr[z[idx]+1]]+=r-z[idx];
                mx=max(mx,ctr[arr[z[idx]+1]]);
            }
        }
        for(const auto& idx : sidx[i-1])
        {
            if(idx<=i)
            {
                continue;
            }
            int l=z[idx]+1,r=n-idx+1;
            while(l<r)
            {
                int mid=(l+r+1)>>1;
                if(((gethash(1,i-1)*pw[mid-(i-1)]+arr[z[idx]+idx]*pw[mid-i])+gethash(i+1,mid))==gethash(idx,idx+mid-1))
                {
                    l=mid;
                }
                else
                {
                    r=mid-1;
                }
            }
            add+=z[idx];
            if(idx+z[idx]<=n)
            {
                ctr[arr[idx+z[idx]]]+=r-z[idx];
                vec.emplace_back(arr[idx+z[idx]]);
                if(arr[idx+z[idx]]!=arr[i])
                {
                    mx=max(mx,ctr[arr[idx+z[idx]]]);
                }
            }
        }
        ans[i]+=mx+add;
        for(const auto& it : vec)
        {
            ctr[it]=0;
        }
    }
    ll final=0;
    for(int i=1;i<=n;i++)
    {
        final+=ans[i]^i;
    }
    cout<<final<<endl;
}
signed main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}
/*
1
4
2 1 1 2
*/