#include<bits/stdc++.h>
#define int long long
using namespace std;
int read()
{
	int x = 0, f = 1;
	char c = getchar();
	while(c != EOF and !isdigit(c))
	{
		if(c == '-')f = -1;
		c = getchar();
	}
	while(isdigit(c))
	{
		x = x * 10 + c - '0';
		c = getchar();
	}
	return x * f;
}
int n, m;
int tree1[1000010], tree[1000010];
int lowbit(int x){return x & (-x);}
void update(int x, int k)
{
	for(int i = x;i <= n;i += lowbit(i))tree[i] += k;
}
int query(int x)
{
	if(x == 0)return 0;
	int ans = 0;
	for(int i = x;i;i -= lowbit(i))ans += tree[i];
	return ans;
}
void update1(int x, int k)
{
	for(int i = x;i <= n;i += lowbit(i))tree1[i] += k;
}
int query1(int x)
{
	if(x == 0)return 0;
	int ans = 0;
	for(int i = x;i;i -= lowbit(i))ans += tree1[i];
	return ans;
}
int a[1010][1010];
vector<int>l;
signed main()
{
	int T = read();
	while(T --)
	{
		l.clear();
		n = read();
		for(int i = 1;i<= n;i ++)
		{
			for(int j = 1;j <= n;j ++)
			{
				a[i][j] = read();
			}
			if(i % 2 == 1)for(int j = 1;j <= n;j ++)l.push_back(a[i][j]);
			if(i % 2 == 0)for(int j = 1;j <= n;j ++)l.push_back(a[i][n-j+1]);
		}
		int ans = 0;
		for(int i = 1;i < n*n;i ++)
		{
			if(l[i] > l[i - 1])ans ++;
		}
		if(ans <= n*n - ans)
		{
			for(int i = 0;i < n*n;i ++)cout<<l[i]<<' ';
			cout<<endl;
		}
		else{
			for(int i = 0;i < n*n;i ++)cout<<l[n*n-i-1]<<' ';
			cout<<endl;
		}
	}
	
	return 0;
}