#include <iostream>
#include <unordered_map>
#include <algorithm>
#include <string.h>
#include <cassert>
#include <random>
#include <time.h>
#include <map>
#define lowbit(x) ((x) & (-(x)))
#define int long long
using namespace std;
const int B = 13331;
const int P = 1000000007;
int tsa;
int n, m;
string str[300005], s[300005];
int sa[600005], rk[600005], ht[600005];
pair<int, int> mn[20][600005];
int lg2[600005];
namespace SA {
    int X[600005], Y[600005];
    int c[600005], x[600005], y[600005];
    // int c[600005], *x = X, *y = Y;
    int t[600005];
    void SA(string str, int n) {
        // memset(x, 0, sizeof x);
        // memset(y, 0, sizeof y);
        int m = 100;
        for (int i = 0; i <= n + 1; i++) x[i] = y[i] = sa[i] = rk[i] = ht[i] = 0;
        for (int i = 0; i <= m; i++) c[i] = 0;
        for (int i = 1; i <= n; i++) c[x[i] = str[i] - 'a' + 1]++;
        for (int i = 1; i <= m; i++) c[i] += c[i - 1];
        for (int i = 1; i <= n; i++) sa[c[x[i]]--] = i;
        // for (int i = 1; i <= n; i++) cout << sa[i] << " ";
        // cout << "\n";
        // for (int i = 1; i <= n; i++) cout << x[i] << " ";
        // cout << "\n";
        for (int d = 1; d <= n; d <<= 1) {
            int tmp = 0;
            for (int i = n - d + 1; i <= n; i++) y[++tmp] = i;
            for (int i = 1; i <= n; i++) {
                if (sa[i] > d) 
                    y[++tmp] = sa[i] - d;
            }
            // cout << "x : ";
            // for (int i = 1; i <= n; i++) cout << x[i] << " ";
            // cout << "\n";
            // cout << "y : ";
            // for (int i = 1; i <= n; i++) cout << y[i] << " ";
            // cout << "\n";
            // cout << "sa : ";
            // for (int i = 1; i <= n; i++) cout << sa[i] << " ";
            // cout << "\n";
            for (int i = 1; i <= m; i++) c[i] = 0;
            for (int i = 1; i <= n; i++) c[x[i]]++;
            for (int i = 1; i <= m; i++) c[i] += c[i - 1];
            for (int i = n; i; i--) sa[c[x[y[i]]]--] = y[i], y[i] = 0;
        // int ttt = clock();
            swap(x, y);
        // tsa += clock() - ttt;
            x[sa[1]] = tmp = 1;
            for (int i = 2; i <= n; i++) 
                x[sa[i]] = (tmp += (y[sa[i]] != y[sa[i - 1]] || y[sa[i] + d] != y[sa[i - 1] + d]));
            m = tmp;
            // if (tmp == n) 
            //     break;
        }
        // for (int i = 1; i <= n; i++) cout << sa[i] << " ";
        // cout << "\n";
        str += '!';
        for (int i = 1; i <= n; i++) rk[sa[i]] = i;
        // cout << str << "\n";
        for (int i = 1, k = 0; i <= n; i++) {
            k -= (k != 0);
            while (str[i + k] == str[sa[rk[i] - 1] + k]) ++k;
            ht[rk[i]] = k;
        }
        lg2[0] = -1;
        // for (int i = 1; i <= n; i++) cout << ht[i] << " ";
        // cout << "\n";
        for (int i = 1; i <= n; i++) mn[0][i] = make_pair(ht[i], i), lg2[i] = lg2[i - 1] + ((i & (i - 1)) == 0);
        for (int i = 1; (1 << i) <= n; i++) {
            for (int j = 1; j + (1 << i) - 1 <= n; j++) 
                mn[i][j] = min(mn[i - 1][j], mn[i - 1][j + (1 << (i - 1))]);
        }
    }
}
int bg[300005], fdsa[300005];
int len[300005], o[300005], cnt[300005];
inline pair<int, int> Query(int l, int r) {
    // assert(l <= r);
    int k = lg2[r - l + 1];
    return min(mn[k][l], mn[k][r - (1 << k) + 1]);
}
inline int lcp(int x, int y) { return Query(min(rk[x], rk[y]) + 1, max(rk[x], rk[y])).first; }
// lcp of str[x]'s p suffix and str[y]'s q suffix
inline int LCP(int x, int y, int p = 1, int q = 1) { return lcp(bg[x] + p - 1, bg[y] + q - 1); }
// return whether (str[x]'s p suffix) is lexicographically strictly smaller than (str[y]'s q suffix)
bool cmp(int x, int y, int p = 1, int q = 1) {
    int a = min(min(len[x] - p + 1, len[y] - q + 1), LCP(x, y, p, q));
    // cerr << x << " " << y << " " << a << " " << len[x] << " " << len[y] << "\n";
    assert(p + a - 1 <= len[x] && q + a - 1 <= len[y]);
    if (p + a > len[x] && q + a > len[y]) 
        return 0;
    if (p + a > len[x]) 
        return 1;
    if (q + a > len[y]) 
        return 0;
    return str[x][p + a] < str[y][q + a];
}
unordered_map<int, int> mp;
// map<int, int> mp;
int ans, acnt;
int app[300005], pre[300005];
int val[300005];
struct qquery {
    int x, l, r, v;
} qs[300005];
int qcnt;
struct BIT {
    int bit[300005];
    inline void add(int x, int y) { for (; x <= 300000; x += lowbit(x)) bit[x] += y; }
    inline void add(int l, int r, int v) { add(l, v), add(r + 1, -v); }
    int query(int x) {
        int ret = 0;
        for (; x; x -= lowbit(x)) ret += bit[x];
        return ret;
    }
} bit;
random_device rd;
mt19937 mtrand(rd());
string rstr() {
    int s = mtrand() % 5 + 1;
    string ret;
    for (int i = 0; i < s; i++) ret += mtrand() % 2 + 'a';
    return ret;
}
signed main() {
    // ios::sync_with_stdio(false);
    // cin.tie(0);
    // cout.tie(0);
    int tc;
    cin >> tc;
    // int tttt = clock();
    // while (1) {
    while (tc--) {
        mp.clear();
        string S = " ";
        // n = 10;
        // for (int i = 1; i <= n; i++) str[o[i] = i] = rstr(), fdsa[i] = bg[i] = S.size(), S += str[i], S += '{', len[i] = str[i].size();
        // cout << n << "\n";
        // for (int i = 1; i <= n; i++) cout << str[i] << "\n";
        cin >> n;
        for (int i = 1; i <= n; i++) cin >> str[o[i] = i], fdsa[i] = bg[i] = S.size(), S += str[i], S += '{', len[i] = str[i].size();

        int Ans = 0;
        for (int i = 1; i <= n; i++) {
            for (int j = i + 1; j <= n; j++) {
                for (int k = j + 1; k <= n; k++) {
                    if ((str[i] + str[j] > str[k] || str[j] + str[i] > str[k]) && (str[i] + str[k] > str[j] || str[k] + str[i] > str[j]) && (str[j] + str[k] > str[i] || str[k] + str[j] > str[i])) {
                        ++Ans;
                        // cout << i << " " << j << " " << k << "\n";
                    }
                }
            }
        }
        // cout << Ans << "\n";

        // cout << S << "\n";
        // for (int i = 0; i < (int)S.size(); i++) cout << i << " " << S[i] << "\n";
        // for (int i = 1; i <= n; i++) cout << bg[i] << " ";
        // cout << "\n";
        // int ttt = clock();
        SA::SA(S, (int)S.size() - 1);
        // tsa += clock() - ttt;
        // cerr << LCP(3, 2) << "\n";
        for (int i = 1; i <= n; i++) s[i] = str[i] = ' ' + str[i];
        sort(o + 1, o + n + 1, [](int a, int b) { return cmp(a, b); });
        // cout << cmp(2, 1) << " asdf\n";
        // return 0;
        m = n, n = ans = 0;
        for (int i = 1; i <= m; i++) {
            if (i == 1 || s[o[i]] != s[o[i - 1]]) {
                cnt[++n] = 1;
                bg[n] = fdsa[o[i]], str[n] = s[o[i]];
            } else 
                ++cnt[n];
        }
        for (int i = 1; i <= n; i++) len[i] = (int)str[i].size() - 1, pre[i] = pre[i - 1] + cnt[i];
        // cout << n << "\n";
        // for (int i = 1; i <= n; i++) cout << str[i] << " " << bg[i] << " " << len[i] << " " << cnt[i] << "\n";
        // 3 sames
        for (int i = 1; i <= n; i++) ans += cnt[i] * (cnt[i] - 1) * (cnt[i] - 2) / 6;

        // 2 sames
        for (int i = 1; i <= n; i++) ans += pre[i - 1] * cnt[i] * (cnt[i] - 1) / 2;

        // no sames
        for (int i = 1, h, tmp; i <= n; i++) {
            for (int j = 1 + (tmp = h = acnt = qcnt = 0); j <= len[i]; j++) {
                h = (h * B + str[i][j] - 'a' + 1) % P;
                if (mp.count(h)) {
                    app[++acnt] = mp[h];
                    if (cmp(i, app[acnt], len[app[acnt]] + 1)) 
                        tmp += cnt[app[acnt]] * (cnt[app[acnt]] - 1) / 2;
                }
            }
            mp[h] = i;
            // cout << i << " " << tmp << " contrib\n";
            for (int j = 1; j <= acnt; j++) {
                int l = 1, r = app[j] - 1, mid, asdf = app[j];
                while (l <= r) {
                    mid = (l + r) >> 1;
                    if (cmp(i, mid, len[app[j]] + 1)) 
                        asdf = mid, r = mid - 1;
                    else 
                        l = mid + 1;
                }
                l = asdf, r = app[j] - 1;
                // cout << l << " " << r << "\n";
                if (l <= r) {
                    tmp += (pre[r] - pre[l - 1]) * cnt[app[j]];
                    qs[++qcnt] = (qquery) { app[j], l, r, cnt[app[j]] };
                }

                val[j] = i, l = app[j] + 1, r = i - 1;
                while (l <= r) {
                    mid = (l + r) >> 1;
                    if (cmp(i, mid, len[app[j]] + 1)) 
                        val[j] = mid, r = mid - 1;
                    else 
                        l = mid + 1;
                }
                // cout << val[j] << "\n";
                qs[++qcnt] = (qquery) { val[j], app[j], -1, cnt[app[j]] };
                tmp += (pre[i - 1] - pre[val[j] - 1]) * cnt[app[j]];
            }
            // cout << i << " " << tmp << " contrib\n";
            sort(qs + 1, qs + qcnt + 1, [](qquery a, qquery b) { return (a.x == b.x) ? (a.r < b.r) : (a.x < b.x); });
            for (int j = qcnt; j; j--) {
                if (qs[j].r != -1) 
                    bit.add(qs[j].l, qs[j].r, qs[j].v);
                else 
                    tmp -= qs[j].v * bit.query(qs[j].l);
            }
            for (int j = 1; j <= qcnt; j++) qs[j].r != -1 ? bit.add(qs[j].l, qs[j].r, -qs[j].v) : void();
            ans += tmp * cnt[i];
            // cout << i << " " << tmp << " contrib\n";
        }
        cout << ans << "\n";
        // if (ans != Ans) {
        //     cout << ans << " " << Ans << "\n";
        //     cout << n << "\n";
        //     for (int i = 1; i <= n; i++) cout << str[i] << "\n";
        //     cout << m << "\n";
        //     for (int i = 1; i <= m; i++) cout << s[i] << "\n";
        //     assert(0);
        // }
    }
    // cout << tsa * 1.0 / CLOCKS_PER_SEC << "\n";
    // cout << (clock() * 1.0 - tttt) / CLOCKS_PER_SEC << "\n";
    return 0;
}
/*
2
10
bbabb
aabba
babba
babbb
a
babaa
bba
aabba
aba
ab

10
b
ba
a
bbb
aaaa
ba
a
aa
bbbba
bba

4
10
aaaba
aba
bab
a
abbb
abbb
bbb
aab
baa
baa

10
b
aaa
aa
b
ab
a
bba
a
ba
ba

10
a
a
bbabbba
bbabb
babaaba
bb
babbaaa
bab
b
aaaba

9
a
bbabbba
bbabb
babaaba
bb
babbaaa
bab
b
aaaba
*/