//Linkwish's code
#include<bits/stdc++.h>
#define lasp(x) (note[x][len[x]-1])
#define endl '\n'
#define si inline
#define fi first
#define se second
using namespace std;
typedef long long ll;typedef __int128 li;
typedef pair<int,int> pii;typedef pair<ll,ll> pll;
typedef const int ci;typedef const ll cl;ci iinf=INT_MAX;cl linf=1e18;
template<typename T>si bool gmax(T &x,const T y){if(x<y)return x=y,1;return 0;}
template<typename T>si bool gmin(T &x,const T y){if(y<x)return x=y,1;return 0;}

namespace LinkWish{

	ci N=1200005;
	int n;
	vector<int> s[N];
	int len[N];
	vector<int> note[N];

	struct Hoshino{
		int fa,len,sz,tr[27],id,edp;
	}t[N];
	vector<int> e[N];
	int las,cnt;
	si void insert(int ch){
		int cur=0,p=las,q,clone;
		if((q=t[p].tr[ch])){
			if(t[q].len==t[p].len+1)return las=q,void();
			t[clone=++cnt]=t[q],t[clone].len=t[p].len+1,t[q].fa=las=clone;
			while(~p&&t[p].tr[ch]==q)t[p].tr[ch]=clone,p=t[p].fa;
		}
		else{
			t[las=cur=++cnt].len=t[p].len+1;
			while(~p&&!t[p].tr[ch])t[p].tr[ch]=cur,p=t[p].fa;
			if(p==-1)return t[cur].fa=0,void();
			if(t[q=t[p].tr[ch]].len==t[p].len+1)return t[cur].fa=q,void();
			t[clone=++cnt]=t[q],t[clone].len=t[p].len+1,t[cur].fa=t[q].fa=clone;
			while(~p&&t[p].tr[ch]==q)t[p].tr[ch]=clone,p=t[p].fa;
		}
	}

	si string getstr(int x){
		string res;
		for(int i=t[x].edp;i>=t[x].edp-t[x].len+1;i--)res+=char(s[t[x].id][i]+'a');
		return res;
	}
	si void outp(int x){
		for(int i=t[x].edp-t[x].len+1;i<=t[x].edp;i++)
			cerr<<s[t[x].id][i];
		cerr<<endl;
	}

	int pf[N][20];
	void dfs(int x){
		for(int i=1;i<20&&~pf[x][i-1];i++)pf[x][i]=pf[pf[x][i-1]][i-1];
		for(int to:e[x]){
			pf[to][0]=x,dfs(to);
			if(!t[x].id)t[x].id=t[to].id,t[x].edp=t[to].edp;
		}
		sort(e[x].begin(),e[x].end(),[&](int p,int q){
			return s[t[p].id][t[p].edp-t[x].len]<s[t[q].id][t[q].edp-t[x].len];
		});
	}

	int dfn[N],out[N],ind[N],sign;
	void getdfn(int x){
		sign+=2,ind[sign-1]=ind[dfn[x]=sign]=x;
		for(int to:e[x])getdfn(to);
		out[x]=sign;
	}

	si int getp(int x,int len){
		for(int i=19;~i;i--)
			if(~pf[x][i]&&t[pf[x][i]].len>=len)x=pf[x][i];
		return x;
	}
	si int getrg(int id,int r,int len){return getp(note[id][r],len);}
	si int getid(int x,int y){
		int l=dfn[x]+1,r=out[x],mid,res=dfn[x],id;
		while(l<=r){
			id=ind[mid=(l+r)>>1];
			if(dfn[getrg(t[id].id,t[id].edp-t[x].len,t[id].len-t[x].len)]<dfn[y])res=mid,l=mid+1;
			else r=mid-1;
		}
		id=ind[++res];
		if(res<=out[x]&&getrg(t[id].id,t[id].edp-t[x].len,t[id].len-t[x].len)==y)res++;
		return res;
	}

	struct BIT{
		int c[N];
		si int lowb(int x){return x&-x;}
		si void add(int x,int v){for(;x<=sign;x+=lowb(x))c[x]+=v;}
		si int ask(int x){int res=0;for(;x;x-=lowb(x))res+=c[x];return res;}
		si int ask(int l,int r){
			if(r<l)return 0;
			return ask(r)-ask(l-1);
		}
		si int ask(int l,int r,int fl,int fr){
			if(fr<l||fl>r)return ask(l,r);
			if(fl<=l&&fr>=r)return 0;
			int res=0;
			if(fl>l)res+=ask(l,fl-1);
			if(fr<r)res+=ask(fr+1,r);
			return res;
		}
	}A,B;

	si void Clear(){
		for(int i=1;i<=n+1;i++)note[i].clear(),s[i].clear();
		for(int i=0;i<=cnt;i++){
			memset(t[i].tr,0,sizeof t[i]);
			t[i].id=t[i].edp=t[i].fa=t[i].len=t[i].sz=0;
			e[i].clear(),dfn[i]=out[i]=0;
		}
		for(int i=0;i<=sign;i++)A.c[i]=B.c[i]=ind[i]=0;
		t[0].fa=-1,cnt=las=0,sign=0;
	}

	si void solve(int Case){
		Clear();

		cin>>n;
		for(int i=1;i<=n;i++){
			string tmp;cin>>tmp,reverse(tmp.begin(),tmp.end());
			len[i]=tmp.size(),note[i].resize(len[i]),s[i].resize(len[i]);
			for(int j=0;j<len[i];j++)insert(s[i][j]=(tmp[j]-'a')),t[las].edp=j,t[las].id=i,note[i][j]=las;
			las=0;
		}
		insert(26),s[n+1].push_back(26),t[las].id=n+1,t[las].edp=0,note[n+1].push_back(las);
		for(int i=1;i<=n;i++)t[lasp(i)].sz++;

		for(int i=1;i<=cnt;i++)e[t[i].fa].push_back(i);
		for(int i=0;i<=cnt;i++)for(int j=0;j<20;j++)pf[i][j]=-1;
		dfs(0),getdfn(0);

		vector<int> pos(n);
		iota(pos.begin(),pos.end(),1);
		sort(pos.begin(),pos.end(),[&](int x,int y){return dfn[lasp(x)]<dfn[lasp(y)];});

		vector<pii> all;
		for(int i:pos){
			if(all.empty()||lasp(all.back().fi)!=lasp(i))all.emplace_back(i,1);
			else all.back().se++;
		}
		
		ll ans=0;int pre=0;
		for(int i=2;i<=sign;i+=2)A.add(i,t[ind[i]].sz);
		for(auto i=all.begin();i!=all.end();pre+=(i++)->se){
			int np=i->fi,nc=i->se,nid=lasp(np);
			ans+=1ll*nc*(nc-1)/2*pre;
			ans+=1ll*nc*(nc-1)/2*(nc-2)/3;

			for(int now=nid;now;now=t[now].fa)A.add(dfn[now],-t[now].sz);

			int forb=dfn[nid];
			vector<pii> back;
			for(auto j=next(i);j!=all.end();j++){
				int tp=j->fi,tid=lasp(tp),tc=j->se;
				if(getp(tid,t[nid].len)!=nid)break;
				int lid=min(dfn[tid],dfn[note[tp][len[tp]-len[np]-1]])+1;
				int pfn=max(getid(nid,tid),getid(tid,nid));
				forb=dfn[tid];
				if(pfn>=lid){
					if(dfn[nid]>lid)ans+=1ll*nc*(nc-1)/2*tc;
					ans+=1ll*nc*tc*(A.ask(lid,pfn,forb,out[nid])+B.ask(lid,sign));
				}
				lid=getid(tid,nid);
				if(lid>getid(nid,tid)){
					A.add(dfn[tid],-t[tid].sz),B.add(lid,t[tid].sz);
					back.emplace_back(tid,lid);
				}
			}
			for(int now=nid;now;now=t[now].fa)A.add(dfn[now],t[now].sz);
			for(pii j:back){
				B.add(j.se,-t[j.fi].sz);
				A.add(dfn[j.fi],t[j.fi].sz);
			}
		}

		cout<<ans<<endl;
	}

	si void mian(){
		int TT;cin>>TT;
		for(int i=1;i<=TT;i++)solve(i);
	}
}

signed main(){
	#ifndef ONLINE_JUDGE
	assert(freopen("in.in","r",stdin));
	// assert(freopen("out.out","w",stdout));
	assert(freopen("out.err","w",stderr));
	#endif
	ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);   
	LinkWish::mian();
	return 0;
}