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

vector<int>req(int n, int t){
    vector<int>cnt1(n,0), cnt2(n,0), cx(n,0);
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            if(i*j < n)cnt1[i*j]++;
            else{
                cnt2[(i*j)%n]++;
                cx[(i*j)/n]++;
            }
        }
    }
    if(t == 1)return cnt1;
    else if(t == 2)return cnt2;
    else return cx;
}

int solve2(int n){
    vector<int>r1 = req(n,1), r2 = req(n,2), r3 = req(n,3);
    int cnt = 0 ;
    for(int i=0; i<n; i++){
        for(int j=i+1; j<n; j++){
            if(r1[i] == r1[j] && r2[i] == r2[j] && r3[i] == r3[j]){
                cnt++;
                // return ;
            }
        }
    }
    return cnt;
}

void solve(){
    int n;
    cin >> n;

    vector<int>c1(n,0), c2(n,0), c3(n,0);
    vector<int>r1 = req(n,1), r2 = req(n,2), r3 = req(n,3);

    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            string s;
            cin >> s;
            if(s.length() == 1){
                c1[s[0]-'a']++;
            }else{
                c2[s[1]-'a']++;
                c3[s[0]-'a']++;
            }
        }
    }

    vector<int>ans(n,-1);
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++){
            if(ans[j] != -1)continue;
            if(c1[i] == r1[j] && c2[i] == r2[j] && c3[i] == r3[j]){
                ans[j] = i;
                // break;
            }
        }
    }

    for(int e : ans)cout << (char)(e+'a');
    cout << "\n";
}


int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    // for(int i=1; i<=52; i++)cout << i << ":" << solve2(i) << "\n";



    int t;
    cin >> t;
    while(t--)solve();
}