#include<iostream>
#include<cstring>
#include<vector>
#include<map>
using namespace std;
using LL = long long;

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);

    auto get = [&](char c){
        if (islower(c)) return c - 'a';
        return 26 + c - 'A';
    };

    int T;
    cin >> T;
    while(T--){
        int n;
        cin >> n;
        vector<vector<pair<int, int> > > pos(n);
        map<int, int> target;
        vector<string> g(n * n);
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                int x = i * j;
                target[x] += 1;
                vector<int> v;
                while(x){
                    v.push_back(x % n);
                    x /= n;
                }
                if (v.empty()) v.push_back(0);
                reverse(v.begin(), v.end());
                for(int k = 0; k < v.size(); k++){
                    pos[v[k]].push_back({v.size(), k});
                }
            }
        }
        map<vector<pair<int, int> >, vector<int> > mp;
        for(int i = 0; i < n; i++){
            sort(pos[i].begin(), pos[i].end());
            mp[pos[i]].push_back(i);
        }
        vector<vector<pair<int, int> > > cur(n);
        for(int i = 0; i < n * n; i++){
            string s;
            cin >> s;
            g[i] = s;
            for(int j = 0; j < s.size(); j++){
                cur[get(s[j])].push_back({s.size(), j});
            }
        }

        string ans(n, '.'), res;
        map<vector<int>, vector<int> > choose;
        for(int i = 0; i < n; i++){
            sort(cur[i].begin(), cur[i].end());
            auto &v = mp[cur[i]];
            if (v.size() == 2){
                choose[v].push_back(i);
                continue;
            }
            ans[v.back()] = i < 26 ? char('a' + i) : char('A' + i - 26);
            v.pop_back();
        }

        vector<array<int, 4> > p;
        for(auto [x, y] : choose){
            p.push_back({x[0], x[1], y[0], y[1]});
        }

        auto check = [&](string s){
            vector<int> id(n);
            for(int i = 0; i < n; i++){
                id[get(s[i])] = i;
            }
            map<int, int> cnt;
            for(auto str : g){
                int t = 0;
                for(auto c : str){
                    t = t * n + id[get(c)];
                }
                cnt[t] += 1;
            }
            return cnt == target;
        };
        
        auto dfs = [&](auto &&dfs, int u){
            if (u == p.size()){
                if (check(ans)){
                    res = ans;
                }
                return;
            }
            auto [a, b, c, d] = p[u];
            ans[a] = c < 26 ? char('a' + c) : char('A' + c - 26);
            ans[b] = d < 26 ? char('a' + d) : char('A' + d - 26);
            dfs(dfs, u + 1);
            ans[b] = c < 26 ? char('a' + c) : char('A' + c - 26);
            ans[a] = d < 26 ? char('a' + d) : char('A' + d - 26);
            dfs(dfs, u + 1);
        };
        dfs(dfs, 0);
        cout << res << '\n';
    }

}