#include <bits/stdc++.h>
#define ms(x, v) memset(x, v, sizeof(x))
#define il __attribute__((always_inline)) static
#define U(i,l,r) for(int i(l),END##i(r);i<=END##i;++i)
#define D(i,r,l) for(int i(r),END##i(l);i>=END##i;--i)
using namespace std;
using ll = long long;

#define IC isdigit(c)
#define GC c=getchar()
void rd(auto &x) { x = 0; char GC; bool f = 0;
	for (; !IC; GC) f |= c == '-';
	for (; IC; GC) x = x * 10 + c - 48;
	if (f) x = -x;
}
void rd(auto &x, auto &...y) { rd(x); rd(y...); }
#define meow(...) fprintf(stderr, __VA_ARGS__)
#define Assert(e, v) if (!(e)) { meow("AF@%d\n", __LINE__ ); exit(v); }

#define vc vector
#define eb emplace_back
#define pb push_back

void solve() {
	int n; rd(n);
	string s[n + 1];
	U (i, 1, n) cin >> s[i];
	int cnt = 0;
	U (i, 1, n) U (j, i + 1, n) U (k, j + 1, n) {
		const string &a = s[i], &b = s[j], &c = s[k];
		if ((a + b > c || b + a > c) && (a + c > b || c + a > b) && (b + c > a || c + b > a))
			++cnt;
	}
	printf("%d\n", cnt);
}

int main() {
//	freopen("ava.in", "r", stdin);
//	freopen("ava.ans", "w", stdout);
	int T; rd(T);
	while (T--) {
		solve();
	}
}