#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;

using ll = long long;   using pll = pair<ll, ll>;
const ll N = 300010, M = 1200010, P = 13331, P2 = 2333, mod1 = 998244353, mod2 = 1e9 + 7;
template<typename T>
void print(T x) {
    if(x < 0)  putchar('-'), x = -x;
    if(x / 10)  print(x / 10);
    putchar(x % 10 + '0');
}
int n, st[N], tot[N], ord[N], to[N], ed[N], len[N], lp[N];
string s[N];
ll ans;
vector<int> upd[N];
vector<pll> hx[N];
pll pw[N], hsh[N];
pll operator * (const pll &x, const pll &y) {return {x.fi * y.fi % mod1, x.se * y.se % mod2};}
pll operator + (const pll &x, const pll &y) {return {(x.fi + y.fi) % mod1, (x.se + y.se) % mod2};}
pll operator - (const pll &x, const pll &y) {return {(x.fi - y.fi + mod1) % mod1, (x.se - y.se + mod2) % mod2};}
map<pll, int> num;
map<pll, ll> lsh;
pll get(int i, int l, int r) {
    return hx[i][r] - (l ? hx[i][l - 1] * pw[r - l + 1] : pll(0, 0));
}
struct SA {
    int rk[M], sa[M], buc[M], tp[M], n, m, book[M], cnt[M], fr[M], to[M];
    void clear() {
        for(int i = 0; i <= n; ++i) cnt[i] = book[i] = fr[i] = tp[i] = sa[i] = rk[i] = 0;
        n = 0, m = 230;
    }
    void radixsort() {
        for(int i = 1; i <= n; ++i) ++buc[rk[i]];
        for(int i = 2; i <= m; ++i) buc[i] += buc[i - 1];
        for(int i = n; i > 0; --i)  sa[buc[rk[tp[i]]]--] = tp[i], tp[i] = 0;
        for(int i = 0; i <= m; ++i) buc[i] = 0;
    }
    void getsa() {
        for(int i = 1; i <= n; ++i) tp[i] = i;
        radixsort();
        for(int w = 1, p = 0; w <= n; w <<= 1, m = p, p = 0) {
            for(int i = n - w + 1; i <= n; ++i) tp[++p] = i;
            for(int i = 1; i <= n; ++i) if(sa[i] > w)   tp[++p] = sa[i] - w;
            radixsort();
            for(int i = 1; i <= n; ++i) swap(rk[i], tp[i]);
            p = 0, rk[sa[1]] = ++p;
            for(int i = 2; i <= n; ++i)
                if(tp[sa[i]] == tp[sa[i - 1]] && tp[sa[i] + w] == tp[sa[i - 1] + w])    rk[sa[i]] = p;
                else    rk[sa[i]] = ++p;
            if(p == n)  break;
        }
        for(int i = 1; i <= n; ++i) assert(rk[sa[i]] == i);
        // for(int i = 1; i <= n; ++i) cerr << sa[i] << " ";
        // cerr << "\n";
        // for(int i = 1; i <= n; ++i) cerr << rk[i] << " ";
        // cerr << "\n";
    }
    void work() {
        auto calc = [&](int x) -> pll   {return fr[x] ? get(fr[x], x - st[fr[x]], len[fr[x]] - 1) : pll(0, 0);};
        for(int i = 1, j = 1; i <= n; ++i) {
            while(j <= ::n && (hsh[ord[j]] != calc(sa[i]) && rk[st[ord[j]]] < i))   ++j;
            cnt[i] = j - 1;
        }
    }
}sa;
struct BIT {
    int sum[M], n;
    void clear()    {for(int i = 0; i <= n; ++i)    sum[i] = 0;}
    void upd(int x, int val) {for(++x; x <= n; x += x & (-x))  sum[x] += val;}
    int ask(int x) {int res = 0;    for(++x; x; x -= x & (-x)) res += sum[x];  return res;}
}bit;
int lcp(int i, int x) {
    int l = 0, r = len[i] - x;
    while(l < r) {
        int mid = (l + r + 1) >> 1;
        if(get(i, 0, mid - 1) == get(i, x, x + mid - 1))    l = mid;
        else    r = mid - 1;
    }
    return l;
}
void mian() {
    cin >> n, sa.clear(), ans = 0;
    for(int i = 1; i <= n; ++i) hx[i].clear();
    for(int i = 1; i <= n; ++i) cin >> s[i], len[i] = s[i].length(), s[i] += "0";
    for(int i = 1; i <= n; ++i) {
        sa.book[sa.n + 1] = i, st[i] = sa.n + 1; 
        for(int j = 0; j < len[i]; ++j)  sa.rk[++sa.n] = s[i][j], sa.fr[sa.n] = i;
        ed[i] = sa.n, sa.rk[++sa.n] = 1;
    }
    num.clear(), lsh.clear();
    for(int i = 1; i <= n; ++i) {
        pll res(0, 0);
        for(int j = 0; j < len[i]; ++j)  res = res * pll(P, P2) + pll(s[i][j], s[i][j]), hx[i].pb(res);
        ++num[res], ++lsh[res], hsh[i] = res, ord[i] = i;
    }
    sa.getsa(), bit.n = sa.n;
    sort(ord + 1, ord + n + 1, [&](const int x, const int y){return sa.rk[st[x]] < sa.rk[st[y]];});
    sa.work();
    // for(int i = 1; i <= n; ++i) cerr << sa.rk[st[i]] << " ";
    // cerr << "\n";
    for(int i = 1; i <= n; ++i) {
        if(!lsh[hsh[i]])    continue;
        ll tmp = lsh[hsh[i]];
        ans += tmp * (tmp - 1) * (tmp - 2) / 6 + (tmp - 1) * tmp / 2 * sa.cnt[sa.rk[st[i]]];
        lsh[hsh[i]] = 0;
    }
    for(int x = 1; x <= n; ++x) {
        int i = ord[x];
        for(int j = 0; j + 1 < len[i]; ++j) {
            if(num.find(hx[i][j]) != num.end())  
                ans += 1ll * max(0, sa.cnt[sa.rk[st[i]]] - sa.cnt[sa.rk[st[i] + j + 1]] - num[get(i, j + 1, len[i] - 1)]) * num[hx[i][j]];
        }
        // cerr << i << " : " << ans << "\n";
    }
    for(int i = 1; i <= n; ++i) {
        for(int j = 0; j + 1 < len[i]; ++j) {
            int nw = lcp(i, j + 1); 
            if(s[i][nw] > s[i][j + 1 + nw]) {
                lp[j] = nw, upd[lp[j]].pb(j);
                if(nw <= j && num.find(hx[i][j]) != num.end())  ans -= 1ll * num[hx[i][j]] * (num[hx[i][j]] + 1) / 2;
            }
            else    lp[j] = len[i];
        }
        bit.n = len[i] + 1, bit.clear();
        for(int j = 0; j + 1 < len[i]; ++j) {
            for(int x : upd[j]) 
                if(num.find(hx[i][x]) != num.end()) bit.upd(x, num[hx[i][x]]);
            if(num.find(hx[i][j]) != num.end() && s[i][lp[j]] > s[i][j + lp[j] + 1]) {   
                tot[j] = max(0, bit.ask(j - 1) - bit.ask(lp[j] - 1));
                ans -= 1ll * num[hx[i][j]] * tot[j];
                // for(int k = 0; k < j; ++k)
                //     if(lp[k] <= j && k >= lp[j] && num.find(hx[i][k]) != num.end()) ans -= 1ll * num[hx[i][j]] * num[hx[i][k]];
            }
        }
        for(int j = 0; j < len[i]; ++j) upd[j].clear(), tot[j] = 0;
        // cerr << i << " : " << ans << "\n";
    }
    print(ans), putchar('\n');
}   
int main() {
    #ifdef Kelly
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        freopen("err.txt", "w", stderr);
    #endif
    ios::sync_with_stdio(false), cin.tie(nullptr);
    int T = 1;  cin >> T;
    pw[0] = {1, 1};
    for(int i = 1; i <= 300000; ++i)    pw[i] = pw[i - 1] * pll(P, P2);
    while(T--)  mian();
    return 0;
}