#include <bits/stdc++.h>
using namespace std;
#define sz(x) (long long) (x).size()
#define all(x) (x).begin(), (x).end()
#define show(x) cerr << #x << " is " << x << endl;
#define show2(x,y) cerr << #x << " is " << x << " " << #y << " is " << y << endl;
#define show3(x,y,z) cerr << #x << " is " << x << " " << #y << " is " << y << " " << #z << " is " << z << endl;
#define int long long
typedef pair<int,int> ii;

int n;
map<ii, vector<int> > M;
map<ii, vector<char> > Q;
vector< pair<vector<int>, vector<char> > > bruh;
vector<char> chars;
vector<string> stuff;
vector<string> stuff2;
char order[54];
bool found = false;

void recurse(int i){
	if(i == sz(bruh)){
		stuff2.clear();
		for(int i = 0;i < n;i++) for(int j = 0;j < n;j++){
			int x = i*j;
			
			string s = "";
			s += chars[x/n];
			s += chars[x%n];
			stuff2.push_back(s);
		}
		
		sort(all(stuff2));
		if(stuff == stuff2){
			found = true;
			return;
		}
		return;
	}
	vector<int> idx = bruh[i].first;
	vector<char> cs = bruh[i].second;
	
	vector<int> com = {};
	int m = sz(idx);
	for(int i = 0;i < m;i++) com.push_back(i);
	
	do{
		for(int i = 0;i < m;i++){
			order[idx[i]] = cs[i];
		}
		recurse(i+1);
	} while(next_permutation(all(com)));
}

signed main(){
	//freopen("i.txt","r",stdin);
	ios_base::sync_with_stdio(false); cin.tie(0);
	
	int TC; cin >> TC; while(TC--){
		int n; cin >> n;
		map<int,int> one;
		map<int,int> two;
		
		M.clear();
		Q.clear();
		bruh.clear();
		chars.clear();
		stuff.clear();
		stuff2.clear();

		for(int i = 0;i < n;i++){
			for(int j = 0;j < n;j++){
				int x = i*j;
				one[x%n]++;
				two[x/n]++;
			}
		}
		
		
		
		for(int i = 0;i < n;i++) M[ii(two[i], one[i])].push_back(i);
		
		
		char zero = 'a';
		map<string, int> common;
		
		stuff.clear();
		for(int i = 0;i < n*n;i++){
			string s; cin >> s;
			stuff.push_back(s);
			common[s]++;
		}
		
		for(auto p : common){
			if(p.second == 2*n - 1) zero = p.first[0];
		}
		
		set<char> charset;
		map<char, int> onec;
		map<char, int> twoc;
		for(string &s : stuff){
			if(sz(s) == 1) s = zero + s;
			onec[s[1]]++;
			twoc[s[0]]++;
			charset.insert(s[0]);
			charset.insert(s[1]);
		}
		
		chars.clear();
		for(char x : charset) chars.push_back(x);
		
		Q.clear();
		for(char x : charset) Q[ii(twoc[x], onec[x])].push_back(x);
		
		for(auto p : M){
			bruh.push_back({p.second, Q[p.first]});
		}
		
		found = false;
		sort(all(stuff));
		recurse(0);
		
		for(int i = 0;i < n;i++) cout << order[i];
		cout << '\n';
	}
	
	
}