#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	if(f)x=-x;return x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define N 205
#define inf 0x3f3f3f3f

int n,a[N][N],b[N][N];
vi p[N][N]; 

int bel[N];
bitset<N>e[N],nvis;
bool match(int u){
	for(int i=(e[u]&nvis)._Find_first();i!=N;i=(e[u]&nvis)._Find_next(i))
		if(!bel[i]||(nvis.reset(i),match(bel[i]))) return bel[i]=u,1;
	return 0;
}

void work()
{
	n=read();
	For(i,1,n)For(j,1,n)a[i][j]=read(),p[i][a[i][j]].pb(j);
	For(_,1,n){
		For(i,1,n){
			bel[i]=0;
			For(j,1,n)e[i][j]=(p[i][j].size()>0); 
		}
		For(i,1,n) nvis.set(),assert(match(i));
		For(j,1,n){
			int i=bel[j];
			b[i][_]=p[i][j].back(),p[i][j].pop_back();
		}
	}
	cout<<n*(n-1)/2<<"\n";
	For(i,1,n)For(j,1,i-1)printf("%d %d %d %d\n",i,b[i][j],j,b[j][i]);
}

signed main()
{
	int T=read();
	while(T--)work();
	return 0;
}