#include <bits/stdc++.h>
#define N 300010
#define M 1000010
using ull = unsigned long long;
const ull mp[26] = {
  1, 3, 7, 9, 11,
  13, 17, 19, 21, 29,
  33, 37, 41, 47, 53,
  59, 61, 63, 67, 71,
  73, 77, 79, 83, 85,
  97
};
const ull bs = 131;
int n;
std::string s[N];
std::vector<ull> hsh[N];
std::vector<int> rank[N];
ull mi[N];
int len[N], siz[N];
using pii = std::pair<int, int>;
using t4 = std::tuple<int, int, int, int>;
ull gethsh(int u, int l, int r) {
  ull x = hsh[u][l - 1] * mi[r - l + 1];
  ull y = hsh[u][r];
  return y - x;
}
int getlcp(int x, int xl, int y, int yl) {
  int l = 0, r = std::min(len[x] - xl + 1, len[y] - yl + 1);
  while (l < r) {
    int mid = (l + r + 1) >> 1;
    if (gethsh(x, xl, xl + mid - 1) == gethsh(y, yl, yl + mid - 1)) l = mid;
    else r = mid - 1;
  }
  return l;
}
bool cmp(pii x, pii y) {
  int lcp = getlcp(x.first, x.second, y.first, y.second);
  if (x.second + lcp > len[x.first] && y.second + lcp > len[y.first]) return x.second < y.second;
  if (y.second + lcp > len[y.first]) return 0;
  if (x.second + lcp > len[x.first]) return 1;
  return s[x.first][x.second + lcp - 1] < s[y.first][y.second + lcp - 1];
}
std::unordered_map<ull, int> pai;
void cmax(int& x, int y) {
  if (x < y) x = y;
}
using ll = long long;
ll ans;
int sum[N];
ll tr[N];
std::vector<int> g[N];
void add(int p, int v) {
  while (p <= n) {
    tr[p] += v;
    p += p & -p;
  }
}
ll qur(int p) {
  ll ans = 0;
  while (p) {
    ans += tr[p];
    p &= (p - 1);
  }
  return ans;
}
void gun() {
  ans = 0;
  std::cin >> n;
  std::vector<pii> q;
  pai.clear();
  for (int i = 1; i <= n; ++i) {
    std::cin >> s[i];
  }
  std::sort(s + 1, s + n + 1);
  int m = 0;
  for (int i = 1; i <= n; ++i) {
    if (s[i] != s[i - 1]) {
      s[++m] = s[i];
      siz[m] = 1;
    } else ++siz[m];
  }
  n = m;
  for (int i = 1; i <= n; ++i) {
    g[i].clear();
    sum[i] = sum[i - 1] + siz[i];
    len[i] = s[i].size();
    hsh[i].clear();
    hsh[i].resize(len[i] + 1);
    rank[i].clear();
    rank[i].resize(len[i] + 1);
    for (int j = 1; j <= len[i]; ++j) {
      hsh[i][j] = (hsh[i][j - 1] * bs + mp[s[i][j - 1] - 'a']);
      q.emplace_back(i, j);
    }
  }
  std::sort(q.begin(), q.end(), cmp);
  {int js = 0;
  for (auto [i, j] : q) {
    rank[i][j] = ++js;
  }}
  std::vector<int> p;
  for (int i = 1; i <= n; ++i) {
    pai[hsh[i][len[i]]] = i;
    std::vector<pii> tt;
    for (int j = 1; j < len[i]; ++j) {
      auto hs = hsh[i][j];
      if (!pai.count(hs)) continue;
      int u = pai[hs];
      int pm = rank[i][j + 1];
      int ps = std::upper_bound(p.begin(), p.end(), pm) - p.begin();
      ans += 1ll * (sum[i - 1] - sum[ps]) * siz[u] * siz[i];
      if (ps < u) ans += (1ll * siz[u] * (siz[u] - 1) / 2 - 1ll * siz[u] * siz[u]) * siz[i];
      for (auto [x, y] : tt) {
        if (rank[i][x + 1] < rank[u][1] && pm < rank[y][1]) ans -= 1ll * siz[i] * siz[u] * siz[y];
      }
      tt.emplace_back(j, u);
    }
    ans += 1ll * siz[i] * (siz[i] - 1) / 2 * sum[i - 1];
    ans += 1ll * siz[i] * (siz[i] - 1) * (siz[i] - 2) / 6;
    p.emplace_back(rank[i][1]);
  }
  std::cout << ans << '\n';
}
int main() {
  std::cin.tie(nullptr) -> sync_with_stdio(false);
  for (int i = *mi = 1; i <= 3e5; ++i) mi[i] = mi[i - 1] * bs;
  int T;
  std::cin >> T;
  while (T--) gun();
  return 0;
}