#include <bits/stdc++.h>
using namespace std;

const int N = 3e5 + 5;
const int M = 6e5 + 5;

int T, n, m, p, top, sz[N], st[N], ed[N], ids[M], lst[M], stk[M], lim[M], cnta[M], cntb[M], a[M], sum[M];
int cnt[M], sa[M], id[M], rk[M], nrk[M], ht[M], lg[M], f[M][20];
vector<int> vec[N];
long long ans;

void SA() {
	for (int i = 1; i <= n + 26; i++) {
		cnt[i] = 0;
	}
	for (int i = 1; i <= m; i++) {
		cnt[a[i]]++;
	}
	for (int i = 1; i <= n + 26; i++) {
		cnt[i] += cnt[i - 1];
	}
	for (int i = 1; i <= m; i++) {
		sa[cnt[a[i]]--] = i;
	}
	p = 0;
	for (int i = 1; i <= m; i++) {
		rk[sa[i]] = a[sa[i]] == a[sa[i - 1]] ? p : ++p;
	}
	for (int w = 1; ; w <<= 1) {
		for (int i = 1; i <= p; i++) {
			cnt[i] = 0;
		}
		for (int i = 1; i <= m; i++) {
			cnt[rk[i]]++;
		}
		for (int i = 1; i <= p; i++) {
			cnt[i] += cnt[i - 1];
		}
		p = 0;
		for (int i = 0; i < w; i++) {
			id[++p] = m - i;
		}
		for (int i = 1; i <= m; i++) {
			if (sa[i] > w) {
				id[++p] = sa[i] - w;
			}
		}
		for (int i = p; i >= 1; i--) {
			sa[cnt[rk[id[i]]]--] = id[i];
		}
		p = 0;
		for (int i = 1; i <= m; i++) {
			nrk[sa[i]] = rk[sa[i]] == rk[sa[i - 1]] && rk[sa[i] + w] == rk[sa[i - 1] + w] ? p : ++p;
		}
		for (int i = 1; i <= m; i++) {
			rk[i] = nrk[i];
		}
		if (p == m) {
			break;
		}
	}
	for (int i = 1, k = 0; i <= m; i++) {
		if (k) {
			k--;
		}
		while (a[i + k] == a[sa[rk[i] - 1] + k]) {
			k++;
		}
		ht[rk[i]] = k;
	}
	for (int i = 1; i <= m; i++) {
		f[i][0] = ht[i];
	}
	for (int j = 1; 1 << j <= m; j++) {
		for (int i = 1; i + (1 << j) - 1 <= m; i++) {
			f[i][j] = min(f[i][j - 1], f[i + (1 << j - 1)][j - 1]);
		}
	}
}

int lcp(int i, int j) {
	assert(i <= j);
	int k = lg[j - i + 1];
	return min(f[i][k], f[j - (1 << k) + 1][k]);
}

bool check(int i, int j) {
	int k = lcp(i + 1, j);
	return a[sa[i] + k] <= n;
}

int query(int l, int r) {
	if (l > r) {
		return 0;
	}
	return cntb[r] - cntb[l - 1];
}

void add(int x, int v) {
	for (; x; x -= x & -x) {
		sum[x] += v;
	}
}

int exsum(int x) {
	int res = 0;
	for (; x <= m; x += x & -x) {
		res += sum[x];
	}
	return res;
}

void work() {
	cin >> n;
	for (int i = 1; i <= m; i++) {
		ids[i] = 0;
	}
	m = 0;
	for (int i = 1; i <= n; i++) {
		string str;
		cin >> str;
		sz[i] = str.size();
		st[i] = m + 1;
		ids[m + 1] = i;
		for (char c : str) {
			a[++m] = n + c - 'a' + 1;
		}
		ed[i] = m;
		a[++m] = i;
	}
	SA();
	lst[m] = m;
	for (int i = m; i >= 2; i--) {
		if (a[sa[i] + ht[i]] <= n) {
			lst[i - 1] = lst[i];
		} else {
			lst[i - 1] = i - 1;
		}
	}
	for (int i = 1; i <= m; i++) {
		cntb[i] = cntb[i - 1] + (ids[sa[i]] > 0);
	}
	for (int i = 1; i <= m; i++) {
		cnta[i] = 0;
	}
	ans = 0;
	top = 0;
	for (int t = 1; t <= m; t++) {
		int i = ids[sa[t]];
		if (i == 0) {
			continue;
		}
		long long ans_ = ans;
		while (top && !check(stk[top], t)) {
			int j = ids[sa[stk[top--]]];
			cnta[sz[j]]--;
		}
		stk[++top] = t;
		for (int j = st[i]; j <= ed[i]; j++) {
			int l = j - st[i] + 1;
			lim[l] = 0;
			if (rk[j + 1] < t) {
				ans += 1ll * cnta[l] * query(lst[rk[j + 1]] + 1, t - 1);
				lim[l] = lcp(rk[j + 1] + 1, t) + 1;
				vec[lim[l]].emplace_back(l);
			}
		}
		for (int j = st[i]; j <= ed[i]; j++) {
			int l = j - st[i] + 1;
			for (int k : vec[l]) {
				add(k, cnta[k]);
			}
			if (rk[j + 1] < t) {
				ans -= 1ll * cnta[l] * exsum(max(l + 1, lim[l]));
				if (lim[l] <= l) {
					ans -= 1ll * cnta[l] * (cnta[l] + 1) / 2;
				}
			}
		}
		for (int j = st[i]; j <= ed[i]; j++) {
			int l = j - st[i] + 1;
			for (int k : vec[l]) {
				add(k, -cnta[k]);
			}
			vec[l].clear();
		}
		cnta[sz[i]]++;
	}
	cout << ans << '\n';
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	for (int i = 2; i < M; i++) {
		lg[i] = lg[i >> 1] + 1;
	}
	cin >> T;
	while (T--) {
		work();
	}

	return 0;
}