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

typedef long long ll;
typedef pair<int, int> pii;
typedef tuple<int, int, int> tii;

inline int rd() {
	int sum = 0;
	bool f = 0;
	char ch = getchar();
	for(; !isdigit(ch); ch = getchar()) f |= (ch == '-');
	for(; isdigit(ch); ch = getchar()) sum = sum * 10 + (ch ^ '0');
	return f ? -sum : sum;
}

#define eb emplace_back
#define all(s) (s).begin, (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

constexpr int N = 1000007;

ll ans, sum[N];

vector<int> divs[N];

void upd(int x) {
	for (auto d : divs[x]) {
		ans ^= (sum[d] * d);
		++sum[d];
		ans ^= (sum[d] * d);
	}
}

char s[N];

struct trie {
	struct node {
		int sz, ch[26];
		void clear() {
			sz = 0;
			memset(ch, 0, sizeof(ch));
		}
	} c[N];
	int tot;
	void insert(char *s) {
		int n = strlen(s + 1);
		int nw = 0;
		rep(i, 1, n) {
			int x = s[i] - 'a';
			if (!c[nw].ch[x]) {
				c[nw].ch[x] = ++tot;
				c[tot].clear();
			}
			nw = c[nw].ch[x];
			++c[nw].sz;
			upd(c[nw].sz);
		}
	}
} tr;

inline void work() {
	ans = 0;
	tr.tot = 0;
	tr.c[0].clear();
	int n = rd();
	rep(i, 1, n) sum[i] = 0;
	rep(i, 1, n) {
		scanf("%s", s + 1);
		tr.insert(s);
		printf("%lld\n", ans);
	}
	puts("");
}

int main() {
	rep(i, 1, N - 1) for (int j = i; j < N; j += i) divs[j].eb(i);
	per(t, rd(), 1) work();
	return 0;
}