#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
const int MX=55;

int T, N;
int t1[MX], t2[MX], t3[MX];
bool vis[MX];
vector<int> v[MX];
vector<string> tar;
char ch[MX];
map<char,int> mp;
int read()
{
    int r=0, f=1; char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
    while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
    return r*f;
}
char ti(int a) {return (a<=25)?a+'a':a+'A'-26;}
int tr(char c) {return (c<='z')?c-'a':c-'A'+26;}
void upd(char ch, int opt)
{
    int id=tr(ch);
    if(opt==1) t1[id]++;
    if(opt==2) t2[id]++;
    if(opt==3) t3[id]++;
    // if(opt==3) t1[id]++, t2[id]++;
}
bool ck()
{
    vector<int> tmp, tmp2;
    tmp.clear();
    for(auto s:tar)
    {
        if(s.size()==2) tmp.emplace_back(mp[s[0]]*N+mp[s[1]]);
        else tmp.emplace_back(mp[s[0]]);
    }
    sort(tmp.begin(),tmp.end());
    // for(auto x:tmp) cout << x << " "; cout << '\n';
    for(int i=0;i<N;i++)
        for(int j=0;j<N;j++)
            tmp2.emplace_back(i*j);
    sort(tmp2.begin(),tmp2.end());
    if(tmp!=tmp2) return 0;
    return 1;
}
bool dfs(int d)
{
    if(d==N) return ck();
    for(auto u:v[d])
    {
        if(vis[u]) continue;
        vis[u]=1; ch[d]=ti(u); mp[ti(u)]=d;
        if(dfs(d+1)) return 1;
        vis[u]=0;
    }
    return 0;
}
int main()
{
    // freopen("testdata.in","r",stdin);
    T=read();
    while(T--)
    {
        N=read();
        memset(ch,0,sizeof(ch));
        memset(vis,0,sizeof(vis));
        memset(t1,0,sizeof(t1));
        memset(t2,0,sizeof(t2));
        memset(t3,0,sizeof(t3));
        for(int i=0;i<52;i++) v[i].clear();
        tar.clear();
        mp.clear();
        for(int i=1;i<=N*N;i++)
        {
            string s; cin >> s;
            tar.emplace_back(s);
            if(s.size()==2) 
            {
                if(s[0]==s[1]) upd(s[0],3);
                else upd(s[0],1), upd(s[1],2);
            }
            else upd(s[0],2);
        }
        for(int num=0;num<N;num++)
        {
            int n1=0, n2=0, n3=0;
            for(int i=0;i<N;i++)
            {
                for(int j=0;j<N;j++)
                {
                    int now=i*j;
                    if(now>=N) 
                    {
                        if(now%N==num&&now/N==num) n3++;
                        // if(now%N==num&&now/N==num) n1++, n2++;
                        else if(now%N==num) n2++;
                        else if(now/N==num) n1++;
                    }
                    else if(now==num) n2++;
                }
            }
            // cout << "num=" << num << ", n=" << n1 << " " << n2 << " " << n3 << '\n';
            for(int i=0;i<N;i++)
            {
                if(t1[i]==n1&&t2[i]==n2&&t3[i]==n3) 
                {
                    v[num].emplace_back(i);
                }
            }
        }
        dfs(0);
        for(int i=0;i<N;i++) cout << ch[i]; cout << '\n';
    }
    return (0-0);
}