#include<bits/stdc++.h>
using namespace std;
namespace my_std{
	#define ll long long
	#define bl bool
	ll my_pow(ll a,ll b,ll mod){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res=(res*a)%mod;
			a=(a*a)%mod;
			b>>=1;
		}
		return res;
	}
	ll qpow(ll a,ll b){
		ll res=1;
		if(!b) return 1;
		while(b){
			if(b&1) res*=a;
			a*=a;
			b>>=1;
		}
		return res;
	}
	#define db double
	#define pf printf
	#define pc putchar
	#define fr(i,x,y) for(register ll i=(x);i<=(y);i++)
	#define pfr(i,x,y) for(register ll i=(x);i>=(y);i--)
	#define go(u) for(ll i=head[u];i;i=e[i].nxt)
	#define enter pc('\n')
	#define space pc(' ')
	#define fir first
	#define sec second
	#define MP make_pair
	#define il inline
	#define inf 8e18
	#define random(x) rand()*rand()%(x)
	#define inv(a,mod) my_pow((a),(mod-2),(mod))
	il ll read(){
		ll sum=0,f=1;
		char ch=0;
		while(!isdigit(ch)){
			if(ch=='-') f=-1;
			ch=getchar();
		}
		while(isdigit(ch)){
			sum=sum*10+(ch^48);
			ch=getchar();
		}
		return sum*f;
	}
	il void write(ll x){
		if(x<0){
			x=-x;
			pc('-');
		}
		if(x>9) write(x/10);
		pc(x%10+'0');
	}
	il void writeln(ll x){
		write(x);
		enter;
	}
	il void writesp(ll x){
		write(x);
		space;
	}
}
using namespace my_std;
#define goo(u) for(ll i=headd[u];i;i=e[i].nxt)
ll T,n,a[220][220],head[440],headd[440],cnt=1;
ll s,t,dep[440],lst[440],id[220][220];
bl ck[220][220];
struct node{
	ll nxt,to,w;
}e[100010];
void add(ll u,ll v,ll ww){
	e[++cnt].nxt=head[u];
	e[cnt].to=v;
	e[cnt].w=ww;
	head[u]=cnt;
}
il bl bfs(){
	fr(i,s,t) headd[i]=head[i];
	fr(i,s,t) dep[i]=0;
	dep[s]=1;
	queue<ll> q;
	q.push(s);
	while(!q.empty()){
		ll u=q.front();
		q.pop();
		go(u){
			ll v=e[i].to;
			if(e[i].w>0&&!dep[v]){
				dep[v]=dep[u]+1;
				q.push(v);
			}
		}
	}
	return dep[t];
}
ll dfs(ll u,ll sum){
	if(u==t) return sum;
	ll res=0;
	goo(u){
		ll v=e[i].to;
		if(!sum) break;
		if(e[i].w>0&&dep[v]==(dep[u]+1)){
			ll tmp=dfs(v,min(sum,e[i].w));
			e[i].w-=tmp;
			e[i^1].w+=tmp;
			sum-=tmp;
			res+=tmp;
		}
		headd[u]=i;
	}
	return res;
}
int main(){
	T=read();
	while(T--){
		n=read();
		fr(i,1,n) fr(j,1,n) a[i][j]=read();
		s=0;
		t=2*n+1;
		fr(p,1,n){
			fr(i,1,n){
				add(s,i,1);
				add(i,s,0); 
			}
			fr(i,1,n){
				fr(j,1,n){
					if(ck[i][j]) continue;
					add(i,n+a[i][j],1);
					add(n+a[i][j],i,0);
				}
			}
			fr(i,1,n){
				add(n+i,t,1);
				add(t,n+i,0);
			}
			while(bfs()) dfs(s,inf);
			fr(u,1,n){
				ll col;
				go(u){
					ll v=e[i].to;
					if(v>n&&!e[i].w) col=v-n;
				}
				fr(i,1,n){
					if(!ck[u][i]&&a[u][i]==col){
						id[u][p]=i;
						ck[u][i]=1;
						break;
					}
				}
			}
			fr(i,s,t) head[i]=0;
			cnt=1;
		}
		writeln(n*(n-1)/2);
		fr(i,1,n) fr(j,i+1,n) pf("%lld %lld %lld %lld\n",i,id[i][j],j,id[j][i]);
		fr(i,1,n) fr(j,1,n) ck[i][j]=0;
	}
}