#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>

using namespace std;

#define pii pair<int, int>
#define P make_pair

string t[300010];
char s[2000010];

int T, n, m, SA[2000010], rk[40000010], ht[2000010], q[2000010], k[2000010], h[300010], p[2000010];
long long c[2000010], cnt[2000010], tot[2000010], tail;
long long ans;

priority_queue<pii, vector<pii>, greater<pii> > que;

bool cmp(string x, string y){
  return x.size() < y.size();
}

void ins(int x){
  string t = "";
  for(int i = 1; i <= 4; i++){
    t = (char)('A' + x % 26) + t;
    x /= 26;
  }
  for(int i = 0; i < 4; i++){
    s[++n] = t[i];
  }
}

void _SA(){
  for(int i = 1; i <= n; i++) cnt[i] = rk[i] = SA[i] = ht[i] = 0;
  for(int i = 1; i <= (n << 1); i++) rk[i] = 0;
  for(int i = 1; i <= 256; i++) cnt[i] = 0;
  for(int i = 1; i <= n; i++) cnt[s[i]]++;
  for(int i = 1; i <= 256; i++) cnt[i] += cnt[i - 1];
  for(int i = 1; i <= n; i++) rk[i] = cnt[s[i] - 1] + 1;
  for(int i = 1; i <= n; i++) SA[cnt[s[i]]--] = i;
	for(int i = 0; n >> i; i++){
		int TT = (1 << i), t = 0, mx = rk[SA[n]];
		for(int j = n; j > n - TT; j--) q[++t] = j;
		for(int j = 1; j <= n; j++){
			if(SA[j] > TT) q[++t] = SA[j] - TT;
			cnt[j] = 0;
		}
		for(int j = 1; j <= n; j++) cnt[rk[j]]++;
		for(int j = 1; j <= mx; j++) cnt[j] += cnt[j - 1];
		for(int j = n; j; j--) SA[cnt[rk[q[j]]]--] = q[j];
		for(int i = 1; i <= n; i++){
			k[SA[i]] = !(rk[SA[i] + TT] == rk[SA[i - 1] + TT] && rk[SA[i]] == rk[SA[i - 1]]) + k[SA[i - 1]];
		}
		copy(k + 1, k + n + 1, rk + 1);
	}
  for(int i = 1; i <= n; i++){
    if(rk[i] == 1) continue;
    ht[rk[i]] = max(0, ht[rk[i - 1]] - 1);
    while(s[i + ht[rk[i]]] == s[SA[rk[i] - 1] + ht[rk[i]]]) ht[rk[i]]++;
  }
}

void Add(int x, long long y){
  for(; x; x -= (x & -x)){
    c[x] += y;
  }
}

long long Ask(int x){
  long long ans = 0;
  for(; x <= n; x += (x & -x)){
    ans += c[x];
  }
  return ans;
}

int main(){
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  cin >> T;
  while(T--){
    cin >> m;
    for(int i = 1; i <= m; i++){
      cin >> t[i];
    }
    if(m < 3){
      cout << 0 << "\n";
      continue;
    }        
    sort(t + 1, t + m + 1, cmp);
    n = ans = 0;
    for(int i = 1; i <= m; i++){
      if(i > 1) ins(i - 1);
      h[i] = n + 1;
      for(int j = 0; j < t[i].size(); j++){
        s[++n] = t[i][j];
      }
    }
    ins(m);
    s[n + 1] = ' ';
    for(int i = 1; i <= n; i++) p[i] = 0;
    for(int i = 1; i <= m; i++) p[h[i]] = i;
    _SA();
    while(!que.empty()) que.pop();
    for(int i = 1; i <= n; i++) c[i] = cnt[i] = 0;
    tail = 0;
    for(int i = 2; i <= n; i++){
      while(tail && t[q[tail]].size() > ht[i]) tail--;
      if(!p[SA[i]]) continue;
      for(int j = 1; j <= tail; j++){
        while(!que.empty() && que.top().first < rk[h[q[j]]]){
          int x = que.top().second;
          que.pop();
          Add(rk[h[q[x]]], -cnt[x]);
        }
        int x = rk[SA[i] + t[q[j]].size()];
        ans += 1ll * Ask(x) * cnt[j];
        if(x < rk[h[q[j]]]) ans -= 1ll * cnt[j] * (cnt[j] + 1) / 2, Add(rk[h[q[j]]], -cnt[j]);
        else if(x < i) que.push(P(x, j));
      }
      while(!que.empty()){
        int x = que.top().second;
        que.pop();
        Add(rk[h[q[x]]], -cnt[x]);
      }
      for(int j = 1; j <= tail; j++){
        int x = rk[SA[i] + t[q[j]].size()];
        if(x < i) Add(rk[h[q[j]]], cnt[j]);
      }
      if(tail && t[q[tail]].size() == t[p[SA[i]]].size()) cnt[tail]++;
      else cnt[++tail] = 1, q[tail] = p[SA[i]];
      Add(i, 1);
    }
    cout << ans << "\n";    
  }
	return 0;
}