#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define FOR(i,a,b) for (int i = (a); i < (b); i++)
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
using ld=long double;
using vi=vector<int>;
template<class T> using oset =tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update> ;
//上
ll ans = 0;
struct NOD{
    int occ;
    int nxt[26];
    NOD(){
        occ = 1;
        fill(begin(nxt),end(nxt),-1);
    }
};
void add_string(string& s,vector<NOD>&Trie,vector<vector<ll>> &vals,vector<ll> &dp){
    int p1 = 0;
    for(int i = 0; i < s.size();i++){
        if(Trie[p1].nxt[s[i]-'a'] == -1){
            Trie[p1].nxt[s[i]-'a'] = Trie.size();
            Trie.emplace_back();
        }else{
            Trie[Trie[p1].nxt[s[i]-'a']].occ++;
        }
        p1 = Trie[p1].nxt[s[i]-'a'];
        for(int j = 0;j  <vals[Trie[p1].occ].size();j++){
            ans^=dp[vals[Trie[p1].occ][j]]*vals[Trie[p1].occ][j];
            dp[vals[Trie[p1].occ][j]]++;
            ans^=dp[vals[Trie[p1].occ][j]]*vals[Trie[p1].occ][j];
        }
    }
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t;
    cin >> t;
    while(t--){
        int n;
        cin >> n;
        vector<string> v(n);
        vector<NOD> Trie(1);
        ll su = 0;
        FOR(i,0,n){
            cin >> v[i];
            su+=v.size();
        }
        ans = 0;
        vector<ll> dp(su+2);
        vector<vector<ll>> vals(n+1);
        for(int i = 1; i<= n; i++){
            for(int j = i; j <= n; j+= i) vals[j].push_back(i);
        }
        for(int i = 0; i < n; i++){
            add_string(v[i],Trie,vals,dp);
            cout <<ans <<" ";
        }cout<<'\n';
    }
}