#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cmath>
#define FOR() ll le=e[u].size();for(ll i=0;i<le;i++)
#define QWQ cout<<"QwQ\n";
#define ll long long
#include <vector>
#include <queue>
#include <map>

using namespace std;
const ll N=801010;
const ll qwq=303030;
const ll inf=0x3f3f3f3f;

inline ll read() {
    ll sum = 0, ff = 1; char c = getchar();
    while(c<'0' || c>'9') { if(c=='-') ff = -1; c = getchar(); }
    while(c>='0'&&c<='9') { sum = sum * 10 + c - '0'; c = getchar(); }
    return sum * ff;
}

ll T,n;
ll tot;
char s[N];
ll siz[N],siz2[N],siz3[N];
ll ans;
ll to[N][26];
ll xiao;
ll fa[N];
ll hou[27];

void calc(ll u,ll v) {
    hou[26] = 0;
    for(ll i=25;i>=0;i--) {
        hou[i] = hou[i+1];
        if(to[v][i]) hou[i] += siz2[to[v][i]];
    }
    for(ll i=0;i<26;i++) {
        ll xia = to[u][i];
        if(!xia) continue;
        ans += siz3[xia] * hou[i+1];
    }
    for(ll i=0;i<26;i++) {
        if(to[u][i] && to[v][i]) calc(to[u][i],to[v][i]);
    }
}

void DFS(ll u) {
    if(siz[u]) {
        if(siz[u]>=2) {
            ans += xiao * (siz[u]*(siz[u]-1)/2);
        }
        if(siz[u]>=3) {
            ans += siz[u]*(siz[u]-1)*(siz[u]-2)/6;
        }
        xiao += siz[u];
        while(siz[u]--) {
            // for(ll i=0;i<26;i++) if(to[u][i] && to[0][i]) calc(to[u][i],to[0][i]);
            calc(u,0);
            ll now = u;
            while(now) {
                siz2[now]++;
                now = fa[now];
            }
        }
    }
    for(ll i=0;i<26;i++) {
        if(to[u][i]) DFS(to[u][i]);
    }
}

void chushihua() {
    for(ll i=0;i<=tot;i++) {
        for(ll j=0;j<26;j++) to[i][j] = 0;
        siz[i] = siz2[i] = siz3[i] = fa[i] = 0;
    }
    xiao = 0;
    ans = 0;
    tot = 0;
}

int main() {
    T = read();
    while(T--) {
        chushihua();
        n = read();
        for(ll i=1;i<=n;i++) {
            ll now = 0;
            scanf("%s",s+1); ll le = strlen(s+1);
            for(ll j=1;j<=le;j++) {
                ll c = s[j] - 'a';
                if(!to[now][c]) to[now][c] = ++tot, fa[tot] = now;
                now = to[now][c];
            }
            siz[now]++;
            while(now) {
                siz3[now]++;
                now = fa[now];
            }
        }
        DFS(0);
        cout<<ans<<"\n";
    }
    return 0;
}

/*

1
6
cbaa
cb
cb
cbaa
ba
ba

*/