#include<bits/stdc++.h>
using namespace std;
//#define int long long
#define endl '\n'
using ll = long long ;
using pii = pair<int,int>;
template<class T>
T lowbit(T x){ return x&-x;}
#define ls u<<1
#define rs u<<1|1
const int mod = 998244353;
const int N = 2e5+10;
const int M = N<<1;
const int P = 1e9+7;
void solve(int id)
{
	int n;cin>>n;
	vector<int> vis(n+1,0);
	vector<pii> ans;
	queue<int> q;
	vector<vector<int>> adj(n+1,vector<int>(n+1,0));
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++) cin>>adj[i][j];
	}
	q.push(1);
	while(!q.empty())
	{
		int u=q.front();
		q.pop();
		for(int i=2;i<=n;i++)
		{
			if(!vis[adj[u][i]]) 
			{
				ans.emplace_back(u,adj[u][i]);
				break;
			}
		}
		for(int i=n;i>=2;i--)
		{
			if(!vis[adj[u][i]])
			{
				q.push(adj[u][i]);
				vis[adj[u][i]]=1;
				break;
			}
		}
	}
	ans.pop_back();
	for(auto [x,y]:ans) cout<<x<<' '<<y<<endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int t=1;
	cin>>t;
	for(int i=1;i<=t;i++) solve(i);
}