#include<bits/stdc++.h>

using namespace std;
using ll = long long;
using pii = pair<int,int>;

int n;
int m[66][66];
int st[66][66] = {0};

int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};

void bfs(int x,int y){
	queue<pii>q;
	q.push({x,y});
	st[x][y] = 1;
	int num = -1;
	auto check = [](int x,int y){
		if(x<0 ||y<0)return false;
		if(x>=n || y>=n)return false;
		if(st[x][y])return false;
		return true;
	};
	
	while(!q.empty()){
		pii u = q.front();
		cout<<m[u.first][u.second] << (++num <= n ?" " :"\n");
		q.pop();
		int vx = -1,vy = -1,tmp = 0;
		for(int i = 0;i<4;i++){
			int tx = u.first  + dx[i];
			int ty = u.second + dy[i];
			if(check(tx,ty) && m[tx][ty]>tmp){
				vx = tx;
				vy = ty;
			}
		}
		if(vx!=-1 && vy!=-1){
			st[vx][vy] = 1;
			q.push({vx,vy});
		}
	}
}

void solve(){
	cin>>n;
	int x1 = -1,x2=  -1;
	for(int i = 0;i<n;i++){
		for(int j = 0;j<n;j++){
			st[i][j] = 0;
			cin>>m[i][j];
			if(m[i][j] == n*n){
				x1 = i;
				x2 = j;
			}
		}
	}
	bfs(x1,x2);
	
}



signed main(){
	cin.tie(0)->sync_with_stdio(0);
	
	int t;cin>>t;
	while(t--)
		solve();
	return 0;
}