#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
// SA-IS
//   String: string, vector<int>, vector<long long>
//   if sigma <= n,  O(n) time, O(n) space
//   if sigma >  n,  O(n log n) time, O(n) space
template <class String> vector<int> suffixArrayRec(const String &as) {
  const int n = as.size();
  if (n == 0) return {};
  const auto minmaxA = minmax_element(as.begin(), as.end());
  const auto minA = *minmaxA.first, maxA = *minmaxA.second;
  if (static_cast<unsigned long long>(maxA) - minA >=
      static_cast<unsigned long long>(n)) {
    vector<int> us(n);
    for (int u = 0; u < n; ++u) us[u] = u;
    std::sort(us.begin(), us.end(), [&](int u, int v) -> bool {
      return (as[u] < as[v]);
    });
    int b = 0;
    vector<int> bs(n, 0);
    for (int i = 1; i < n; ++i) {
      if (as[us[i - 1]] != as[us[i]]) ++b;
      bs[us[i]] = b;
    }
    return suffixArrayRec(bs);
  }
  const int sigma = maxA - minA + 1;
  vector<int> pt(sigma + 1, 0), poss(sigma);
  for (int u = 0; u < n; ++u) ++pt[as[u] - minA + 1];
  for (int a = 0; a < sigma; ++a) pt[a + 1] += pt[a];
  // cmp[u] := (as[u, n) < as[u + 1, n))
  vector<bool> cmp(n);
  cmp[n - 1] = false;
  for (int u = n - 1; --u >= 0; ) {
    cmp[u] = (as[u] != as[u + 1]) ? (as[u] < as[u + 1]) : cmp[u + 1];
  }
  // ><,  nn - id (0 <= id < n)
  int nn = 0;
  vector<int> ids(n, 0);
  int last = n;
  vector<int> nxt(n, 0);
  // put ><, from the tail of each bucket
  vector<int> us(n, 0);
  memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
  for (int u = n - 1; --u >= 1; ) if (!cmp[u - 1] && cmp[u]) {
    ids[u] = ++nn;
    nxt[u] = last;
    last = u;
    us[--poss[as[u] - minA]] = u;
  }
  // follow > backwards, from the head of each bucket
  memcpy(poss.data(), pt.data(), sigma * sizeof(int));
  us[poss[as[n - 1] - minA]++] = n - 1;
  for (int i = 0; i < n; ++i) {
    const int u = us[i];
    if (u && !cmp[u - 1]) us[poss[as[u - 1] - minA]++] = u - 1;
  }
  // follow < backwards, from the tail of each bucket
  memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
  for (int i = n; --i >= 0; ) {
    const int u = us[i];
    if (u && cmp[u - 1]) us[--poss[as[u - 1] - minA]] = u - 1;
  }
  if (nn) {
    int vsLen = 0;
    vector<int> vs(nn);
    for (const int u : us) if (ids[u]) vs[vsLen++] = u;
    int b = 0;
    vector<int> bs(nn, 0);
    for (int j = 1; j < nn; ++j) {
      // as[v1, w1] (< or =) as[v0, w0]
      int v1 = vs[j - 1], v0 = vs[j];
      const int w1 = nxt[v1], w0 = nxt[v0];
      if (w1 - v1 != w0 - v0) {
        ++b;
      } else {
        for (; ; ++v1, ++v0) {
          if (v1 == n) { ++b; break; }
          if (as[v1] != as[v0]) { ++b; break; }
          if (v1 == w1) break;
        }
      }
      bs[nn - ids[vs[j]]] = b;
    }
    for (int u = 0; u < n; ++u) if (ids[u]) vs[nn - ids[u]] = u;
    const auto sub = suffixArrayRec(bs);
    // put ><, from the tail of each bucket
    memset(us.data(), 0, n * sizeof(int));
    memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
    for (int j = nn; --j >= 0; ) {
      const int u = vs[sub[j]];
      us[--poss[as[u] - minA]] = u;
    }
    // follow > backwards, from the head of each bucket
    memcpy(poss.data(), pt.data(), sigma * sizeof(int));
    us[poss[as[n - 1] - minA]++] = n - 1;
    for (int i = 0; i < n; ++i) {
      const int u = us[i];
      if (u && !cmp[u - 1]) us[poss[as[u - 1] - minA]++] = u - 1;
    }
    // follow < backwards, from the tail of each bucket
    memcpy(poss.data(), pt.data() + 1, sigma * sizeof(int));
    for (int i = n; --i >= 0; ) {
      const int u = us[i];
      if (u && cmp[u - 1]) us[--poss[as[u - 1] - minA]] = u - 1;
    }
  }
  return us;
}

// us[i]: i-th suffix
// su[u]: index of as[u, n)
// hs[i]: longest common prefix of as[us[i - 1], n) and as[us[i], n)
struct SuffixArray {
  int n;
  bool rmq;
  vector<int> us, su, hs;
  SuffixArray() : n(0), rmq(false) {}
  SuffixArray(const string &as, bool rmq_) : rmq(rmq_) { build(as); }
  SuffixArray(const vector<int> &as, bool rmq_) : rmq(rmq_) { build(as); }
  SuffixArray(const vector<long long> &as, bool rmq_) : rmq(rmq_) { build(as); }
  template <class String> void build(const String &as) {
    n = as.size();
    us = suffixArrayRec(as);
    su.resize(n + 1);
    for (int i = 0; i < n; ++i) su[us[i]] = i;
    su[n] = -1;
    hs.assign(n, 0);
    for (int h = 0, u = 0; u < n; ++u) if (su[u]) {
      for (int v = us[su[u] - 1]; v + h < n && as[v + h] == as[u + h]; ++h) {}
      hs[su[u]] = h;
      if (h) --h;
    }
    if (rmq) {
      const int logN = n ? (31 - __builtin_clz(n)) : 0;
      hs.resize((logN + 1) * n - (1 << logN) + 1);
      for (int e = 0; e < logN; ++e) {
        int *hes = hs.data() + e * n;
        for (int i = 0; i <= n - (1 << (e + 1)); ++i) {
          hes[n + i] = min(hes[i], hes[i + (1 << e)]);
        }
      }
    }
  }
  // Returns longest common prefix of as[u, n) and as[v, n).
  //   0 <= u, v <= n
  //   Assumes rmq.
  inline int lcp(int u, int v) const {
    if (u == v) return n - u;
    int i = su[u], j = su[v];
    if (i > j) swap(i, j);
    const int e = 31 - __builtin_clz(j - i);
    return min(hs[e * n + i + 1], hs[e * n + j + 1 - (1 << e)]);
  }
};
////////////////////////////////////////////////////////////////////////////////


template <class T> void bAdd(vector<T> &bit, int pos, const T &val) {
  const int bitN = bit.size();
  for (int x = pos; x < bitN; x |= x + 1) bit[x] += val;
}
template <class T> T bSum(const vector<T> &bit, int pos) {
  T ret = 0;
  for (int x = pos; x > 0; x &= x - 1) ret += bit[x - 1];
  return ret;
}
template <class T> T bSum(const vector<T> &bit, int pos0, int pos1) {
  return bSum(bit, pos1) - bSum(bit, pos0);
}


char buf[1'000'010];

int N;
vector<string> S;
vector<Int> W;

int U;
int nxt[1'000'010][26];
int wts[1'000'010];
int newNode() {
  const int u = U++;
  fill(nxt[u], nxt[u] + 26, -1);
  wts[u] = 0;
  return u;
}

// string cat;
vector<int> cat;
vector<int> pt;
SuffixArray sa;
vector<Int> wsa;

Int between(int l, int r) {
// cerr<<"[between] "<<cat.substr(l)<<" "<<cat.substr(r)<<endl;
  l = sa.su[l];
  r = sa.su[r];
  return (l < r) ? (wsa[r] - wsa[l + 1]) : 0;
}

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d", &N);
    S.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%s", buf);
      S[i] = buf;
    }
    sort(S.begin(), S.end());
    
#ifdef LOCAL
Int brt=0;
for(int i=0;i<N;++i)for(int j=i+1;j<N;++j)for(int k=j+1;k<N;++k){
 if(S[j]+S[k]>S[i]||S[k]+S[j]>S[i])
 if(S[k]+S[i]>S[j]||S[i]+S[k]>S[j])
 if(S[i]+S[j]>S[k]||S[j]+S[i]>S[k])
 {
  ++brt;
 }
}
#endif
    
    {
      vector<string> SS;
      W.clear();
      for (int i = 0, j = 0; i < N; i = j) {
        for (; j < N && S[i] == S[j]; ++j) {}
        SS.push_back(S[i]);
        W.push_back(j - i);
      }
      S.swap(SS);
      N = S.size();
    }
// cerr<<"N = "<<N<<", S = "<<S<<", W = "<<W<<endl;
    
    U = 0;
    newNode();
    for (int i = 0; i < N; ++i) {
      int u = 0;
      for (const char c : S[i]) {
        int &v = nxt[u][c - 'a'];
        if (!~v) v = newNode();
        u = v;
      }
      wts[u] += W[i];
    }
    
    // cat = "";
    cat.clear();
    pt.resize(N);
    for (int i = 0; i < N; ++i) {
      pt[i] = cat.size();
      // cat += S[i];
      // cat += '!';
      for (const char c : S[i]) cat.push_back(N + (c - 'a'));
      cat.push_back(i);
    }
    sa = SuffixArray(cat, true);
    wsa.assign(sa.n + 1, 0);
    for (int i = 0; i < N; ++i) {
      wsa[sa.su[pt[i]] + 1] += W[i];
    }
    for (int k = 0; k < sa.n; ++k) {
      wsa[k + 1] += wsa[k];
    }
    
    Int ans = 0;
    Int sumW = 0;
    for (int i = 0; i < N; ++i) {
      // 3 S[i]'s
      ans += W[i] * (W[i] - 1) * (W[i] - 2) / 6;
      // 2 S[i]'s
      ans += W[i] * (W[i] - 1) / 2 * sumW;
      sumW += W[i];
      
      const int len = S[i].size();
      vector<Int> pre(len, 0);
      {
        int u = 0;
        for (int x = 0; x < len; ++x) {
          pre[x] += wts[u];
          u = nxt[u][S[i][x] - 'a'];
        }
      }
// cerr<<S[i]<<": pre = "<<pre<<endl;
      Int here = 0;
      for (int x = 0; x < len; ++x) {
        const Int res = between(pt[i] + x, pt[i]);
// if(pre[x])cerr<<"between "<<S[i].substr(x)<<" "<<S[i]<<" = "<<res<<endl;
        here += pre[x] * res;
      }
      /*
        fs[x] <= y < len
        fs[y] <= x < len
      */
      vector<int> fs(len);
      for (int x = 0; x < len; ++x) {
        if (sa.su[pt[i] + x] < sa.su[pt[i]]) {
          fs[x] = sa.lcp(pt[i] + x, pt[i]) + 1;
        } else {
          fs[x] = len;
        }
      }
// cerr<<"  fs = "<<fs<<endl;
      for (int x = 0; x < len; ++x) {
        if (fs[x] <= x) {
          here -= pre[x] * pre[x];
          here += pre[x] * (pre[x] - 1) / 2;
        }
      }
      /*
      for (int x = 0; x < len; ++x) for (int y = x + 1; y < len; ++y) {
        if (fs[x] <= y && fs[y] <= x) {
if(pre[x]&&pre[y])cerr<<"  bad "<<x<<" "<<y<<": "<<pre[x]<<" * "<<pre[y]<<endl;
          here -= pre[x] * pre[y];
        }
      }
      */
      {
        vector<vector<int>> yss(len + 1);
        for (int y = 0; y < len; ++y) {
          yss[fs[y]].push_back(y);
        }
        vector<Int> bit(len, 0);
        for (int x = 0; x < len; ++x) {
          for (const int y : yss[x]) {
            bAdd(bit, y, pre[y]);
          }
          here -= pre[x] * bSum(bit, max(x + 1, fs[x]), len);
        }
      }
// cerr<<S[i]<<": ans += "<<W[i]<<" * "<<here<<endl;
      ans += W[i] * here;
    }
    
    printf("%lld\n", ans);
#ifdef LOCAL
if(brt!=ans){
 cerr<<"N = "<<N<<", S = "<<S<<", W = "<<W<<endl;
 cerr<<"brt = "<<brt<<endl;
 cerr<<"ans = "<<ans<<endl;
 assert(false);
}
#endif
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}