#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];
int sx[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] && x.second == 1 && y.second > 1) return 1;
  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::vector<t4> cha;
std::unordered_map<ull, int> shu, xu, pai;
void cmax(int& x, int y) {
  if (x < y) x = y;
}
using ll = long long;
ll ans;
int tr[N];
void add(int p, int v) {
  while (p <= n) {
    tr[p] += v;
    p += p & -p;
  }
}
int qur(int p) {
  int ans = 0;
  while (p) {
    ans += tr[p];
    p &= (p - 1);
  }
  return ans;
}
void dfs(int l, int r) {
  if (std::get<0>(cha[l]) == std::get<0>(cha[r])) {
    std::sort(cha.begin() + l, cha.begin() + r + 1, [](auto x, auto y){return std::get<1>(x) > std::get<1>(y);});
    return;
  }
  int zhong = (std::get<0>(cha[l]) + std::get<0>(cha[r])) >> 1;
  int mid = l;
  while (std::get<0>(cha[mid + 1]) <= zhong) ++mid;
  dfs(l, mid), dfs(mid + 1, r);
  int i, j;
  for (i = mid + 1, j = l; i <= r; ++i) {
    if (!std::get<3>(cha[i])) continue;
    while (j <= mid && std::get<1>(cha[j]) > std::get<1>(cha[i])) {
      if (!std::get<3>(cha[j]))
      add(std::get<2>(cha[j]), 1);
      ++j;
    }
    ans += 1ll * qur(std::get<2>(cha[i]) - 1) * std::get<3>(cha[i]);
  }
  for (int k = l; k < j; ++k)
  if (!std::get<3>(cha[k]))
  add(std::get<2>(cha[k]), -1);
  std::inplace_merge(cha.begin() + l, cha.begin() + mid + 1, cha.begin() + r + 1, [](auto x, auto y){return std::get<1>(x) > std::get<1>(y);});
}
void gun() {
  ans = 0;
  std::cin >> n;
  std::vector<int> p(n);
  std::vector<pii> q;
  shu.clear(), xu.clear(), pai.clear();
  for (int i = 1; i <= n; ++i) {
    std::cin >> s[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);
    }
    p[i - 1] = i;
  }
  std::sort(p.begin(), p.end(), [](int x, int y){return s[x] < s[y];});
  std::stable_sort(p.begin(), p.end(), [](int x, int y){return s[x] + s[y] < s[y] + s[x];});
  for (int i = 0; i < n; ++i) {
    sx[p[i]] = i + 1;
  }
  std::sort(q.begin(), q.end(), cmp);
  {int js = 0;
  for (auto [i, j] : q) {
    rank[i][j] = ++js;
  }}
  std::sort(p.begin(), p.end(), [](int x, int y){return s[x] < s[y];});
  cha.clear();
  for (int i = 1; i <= n; ++i) {
    int u = p[i - 1];
    cha.emplace_back(i, rank[u][1], sx[u], 0);
    pai[hsh[u][len[u]]] = rank[u][1];
    for (int j = 1; j <= len[u]; ++j) {
      auto hs = hsh[u][j];
      if (!shu.count(hs)) continue;
      cha.emplace_back(i, j == len[u] ? 0 : rank[u][j + 1], xu[hs], shu[hs]);
      
      if (pai[hs] > (j == len[u] ? 0 : rank[u][j + 1])) {
        ll tmp = shu[hs];
        ans -= tmp * (tmp - 1) / 2;
      }
    }
    ++shu[hsh[u][len[u]]];
    cmax(xu[hsh[u][len[u]]], sx[u]);
  }
  dfs(0, cha.size() - 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;
}