#include<iostream>
#include<cstring>
#include<vector>
#include<map>
using namespace std;
using LL = long long;
const int maxn = 1000005, N = 10;
vector<int> factor[N + 5];
int tr[maxn][26];
int sz[maxn];
int idx;
vector<int> modify[N + 5];

void clear(){
    for(int i = 0; i <= idx; i++){
        sz[i] = 0;
        tr[i][0] = tr[i][1] = 0;
    }
    idx = 0;
}

void insert(const string &s, int tim){
    int p = 0;
    for(auto c : s){
        int x = c - 'a';
        if (!tr[p][x]) tr[p][x] = ++idx;
        p = tr[p][x];
        for(auto y : factor[sz[p] + 1]){
            modify[y].push_back(tim);
        }
        sz[p] += 1;
    }
}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    for(int i = 1; i <= N; i++){
        for(int j = i; j <= N; j += i){
            factor[j].push_back(i);
        }
    }

    int T;
    cin >> T;
    while(T--){
        clear();
        int n;
        cin >> n;
        for(int j = 1; j <= n; j++){
            modify[j].clear();
            modify[j].push_back(j);
        }
        for(int i = 1; i <= n; i++){
            string s;
            cin >> s;
            insert(s, i);
        }

        vector<int> ans(n + 2);

        for(int j = 1; j <= n; j++){
            modify[j].push_back(n + 1);
            for(int i = 0; i + 1 < modify[j].size(); i++){
                int l = modify[j][i], r = modify[j][i + 1];
                ans[l] ^= i * j;
                ans[r] ^= i * j;
            }
        }
        for(int i = 1; i <= n; i++){
            ans[i] ^= ans[i - 1];
            cout << ans[i] << " \n"[i == n];
        }
    }

}