#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=200+5,M=N*4+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n;vector<int> S[N][N];
int mch[N],vis[N];
int dfs(int x){
	if(vis[x]) return 0;
	vis[x]=1;
	for(int i=1;i<=n;i++) if(!S[x][i].empty()){
		if(!mch[i]||dfs(mch[i])) return mch[i]=x,1;
	}
	return 0;
}
pii ans[N][N];
void Solve(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++){
		int x;scanf("%d",&x);
		S[i][x].push_back(j);
	}
	for(int i=1;i<=n;i++){
		Me(mch,0);
		for(int j=1;j<=n;j++){
			Me(vis,0);
			dfs(j);
		}
		for(int j=1;j<=n;j++){
			int v=mch[j];
			ans[v][i]=make_pair(v,S[v][j].back());
			S[v][j].pop_back();
		}
	}
	printf("%d\n",n*(n-1)/2);
	for(int i=1;i<=n;i++) for(int j=i+1;j<=n;j++) printf("%d %d %d %d\n",ans[i][j].fi,ans[i][j].se,ans[j][i].fi,ans[j][i].se);
}
int main(){
	int t=1;
	scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}