#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
void write(ll x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const ll N=1e6+9;
ll T,n,len[N],L,bg[N],ed[N],bel[N];
char s[N];
ll S[N],sa[N],rk[N],bin[N],fir[N],sec[N],height[N],st[20][N],lg[N];
ll lst[N],sv[N],slen[N],stk[N],zt[N];
vector<ll>vq[N];
void Build(){
    ll sigma=n+27;
    rep(i,0,sigma)bin[i]=0;
    rep(i,1,L)fir[i]=S[i],bin[S[i]]++;
    rep(i,2,sigma)bin[i]+=bin[i-1];
    per(i,L,1)sa[bin[fir[i]]--]=i;
    for(ll k=1;k<=L;k<<=1){
        ll cnt=0;
        rep(i,L-k+1,L)sec[++cnt]=i;
        rep(i,1,L){
            if(sa[i]>k)sec[++cnt]=sa[i]-k;
        }
        rep(i,0,sigma+1)bin[i]=0;
        rep(i,1,L)bin[fir[i]]++;
        rep(i,2,sigma)bin[i]+=bin[i-1];
        per(i,L,1)sa[bin[fir[sec[i]]]--]=sec[i];
        rep(i,1,L)swap(fir[i],sec[i]);
        cnt=1,fir[sa[1]]=1;
        rep(i,2,L){
            if(sec[sa[i]]==sec[sa[i-1]]&&sec[sa[i]+k]==sec[sa[i-1]+k])fir[sa[i]]=cnt;
            else fir[sa[i]]=++cnt;
        }
        sigma=cnt;
        if(sigma==L)break;
    }
    rep(i,1,L)rk[sa[i]]=i;
    ll len=0;
    rep(i,1,L){
        if(len)len--;
        ll j=sa[rk[i]-1];
        while(i+len<=L&&j+len<=L&&S[i+len]==S[j+len])len++;
        height[rk[i]]=len;
    }
    rep(i,2,L)lg[i]=lg[i>>1]+1;
    rep(i,1,L)st[0][i]=height[i];
    rep(k,1,lg[L]){
        rep(i,1,L-(1<<k)+1)st[k][i]=min(st[k-1][i],st[k-1][i+(1<<(k-1))]);
    }
}
ll Query(ll l,ll r){
    ll p=lg[r-l+1];
    return min(st[p][l],st[p][r-(1<<p)+1]);
}
ll bit[N];
void Upd(ll x,ll k){
    while(x)bit[x]+=k,x-=(x&(-x));
}
ll Query(ll x){
    ll res=0;
    while(x<=L)res+=bit[x],x+=(x&(-x));
    return res;
}
ll Qsv(ll l,ll r){
    if(l>r)return 0;
    return sv[r]-sv[l-1];
}
bool chk(ll i,ll j){
    ll lcp=Query(i+1,j);
    return S[sa[i]+lcp]<=n;
}
void solve(){
    n=read();
    rep(i,0,L+1)bel[i]=0,vq[i].clear();
    L=0;
    rep(i,1,n){
        scanf("%s",s+1);
        len[i]=strlen(s+1);
        bg[i]=L+1,bel[L+1]=i;
        rep(j,1,len[i])S[++L]=s[j]-'a'+1+n;
        S[++L]=i,ed[i]=L;
    }
    Build();
    lst[L]=L;
    per(i,L,2){
        if(S[sa[i]+height[i]]<=n)lst[i-1]=lst[i];
        else lst[i-1]=i-1;
    }
    rep(i,1,L)sv[i]=sv[i-1]+(!!bel[sa[i]]);
    rep(i,0,L+1)slen[i]=0;
    ll ans=0,top=0;
    rep(g,1,L){
        ll i=bel[sa[g]];
        if(!i)continue;
        while(top&&!chk(stk[top],g)){
            ll j=bel[sa[stk[top]]];
            top--,slen[len[j]]--;
        }
        stk[++top]=g;
        rep(j,bg[i],ed[i]){
            ll yl=j-bg[i]+1;
            zt[yl]=0;
            if(rk[j+1]<g){
                ans+=slen[yl]*Qsv(lst[rk[j+1]]+1,g-1);
                zt[yl]=Query(rk[j+1]+1,g)+1;
                vq[zt[yl]].push_back(yl);
            }
        }
        rep(j,bg[i],ed[i]){
            ll yl=j-bg[i]+1;
            for(ll k:vq[yl])Upd(k,slen[k]);
            if(rk[j+1]<g){
                ans-=slen[yl]*Query(max(yl+1,zt[yl]));
                if(zt[yl]<=yl)ans-=slen[yl]*(slen[yl]+1)/2;
            }
        }
        rep(j,bg[i],ed[i]){
            ll yl=j-bg[i]+1;
            for(ll k:vq[yl])Upd(k,-slen[k]);
            vq[yl].clear();
        }
        slen[len[i]]++;
    }
    write(ans),putchar('\n');
}
bool Med;
int main(){
    cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
    T=read();
    while(T--)solve();
    cerr<<"\n"<<clock()*1.0/CLOCKS_PER_SEC*1000<<"ms\n";
    return 0;
}