#include<bits/stdc++.h>
#define LL long long
#define SZ(x) ((LL)(x.size()))
using namespace std;
long long read(){
  long long q=0,w=1;
  char ch=getchar();
  while(ch>'9' || ch<'0'){if(ch=='-')w=-1;ch=getchar();}
  while(ch>='0'&&ch<='9'){q=q*10+(ch-'0');ch=getchar();}
  return q*w;
}
void write(LL x){
  if(x<0){putchar('-');x=(-x);}
  if(x>9)write(x/10);
  putchar('0'+x%10);
}
void writeln(LL x){write(x);puts("");}
void writecs(LL x){write(x);putchar(' ');}

template<LL N,LL M>struct dinic{
  struct Edge{
    LL to,nxt,w;
  }e[M<<1];LL head[N],cur[N],tot;
  void add(LL u,LL v,LL w){
    e[++tot].to=v;e[tot].nxt=head[u];
    e[tot].w=w;head[u]=tot;return ;
  }
  void add_e(LL u,LL v,LL w){
    //    cout<<"> add_e: u = "<<u<<" v = "<<v<<" w = "<<w<<endl;
    add(u,v,w);add(v,u,0);
  }
  LL n,S,T;
  void clear(){
    for(LL i=1;i<=n;i++)head[i]=cur[i]=0;
    n=S=T=0;tot=1;return ;
  }
  LL dep[N];
  bool bfs(){
    for(LL i=1;i<=n;i++){dep[i]=-1;cur[i]=head[i];}
    queue<LL>q;q.push(S);dep[S]=0;
    while(!q.empty()){
      LL x=q.front();q.pop();
      for(LL i=head[x];i;i=e[i].nxt)
	if(dep[e[i].to]==-1&&e[i].w){dep[e[i].to]=dep[x]+1;q.push(e[i].to);}
    }
    return (dep[T]!=-1);
  }
  LL dfs(LL x,LL flow){
    if(x==T)return flow;
    LL lastflow=flow;
    for(LL i=cur[x];i&&flow;i=e[i].nxt){
      cur[x]=i;
      if(dep[e[i].to]==dep[x]+1&&e[i].w){
	LL d=dfs(e[i].to,min(flow,e[i].w));
	if(d){e[i].w-=d;e[i^1].w+=d;flow-=d;}
      }
    }
    if(lastflow==flow)dep[x]=-1;
    return lastflow-flow;
  }
  LL solve(){
    LL maxflow=0;
    while(bfs())maxflow+=dfs(S,(LL)(1e18));
    return maxflow;
  }
};

#define PLL pair<LL,LL>
#define mp(a,b) make_pair(a,b)
#define fir first
#define sec second
const long long N = 200+95;
long long TC,n,_a[N][N];vector<PLL>a[N][N];PLL b[N][N];dinic<(N<<1)+2,(N*N+(N<<1))>T;
int main(){
  TC=read();
  while(TC--){
    n=read();
    for(LL i=1;i<=n;i++)
      for(LL j=1;j<=n;j++){LL x=read();a[i][x].push_back(mp(i,j));_a[i][j]=x;}
    
    vector<vector<LL>>tmp(n+2);
    for(LL i=1;i<=n;i++)tmp[i].resize(n+2);
    
    for(LL K=1;K<=n;K++){
      //      cout<<"> K = "<<K<<endl;
      T.clear();LL Id=0;LL s=++Id,t=++Id;
      vector<LL>idxL(n+2),idxR(n+2);
      for(LL i=1;i<=n;i++){
	idxL[i]=++Id;T.add_e(s,idxL[i],1);
	idxR[i]=++Id;T.add_e(idxR[i],t,1);
      }
      for(LL i=1;i<=n;i++)
	for(LL j=1;j<=n;j++)
	  if(SZ(a[i][j])){tmp[i][j]=T.tot+1;T.add_e(idxL[i],idxR[j],1);}
      T.n=Id;T.S=s;T.T=t;
      LL maxflow=T.solve();
      //      cerr<<" maxflow = "<<maxflow<<endl;
      assert(maxflow==n);
      for(LL i=1;i<=n;i++)
	for(LL j=1;j<=n;j++)
	  if(SZ(a[i][j])&&!T.e[tmp[i][j]].w){
	    //	    cout<<" -> i = "<<i<<" j = "<<j<<endl;
	    b[i][K]=a[i][j].back();a[i][j].pop_back();}
    }
    vector<vector<LL>>ans;
    for(LL i=1;i<=n;i++)
      for(LL j=i+1;j<=n;j++)
	ans.push_back({b[i][j].fir,b[i][j].sec,b[j][i].fir,b[j][i].sec});
    writeln(SZ(ans));
    for(LL i=0;i<SZ(ans);i++){
      for(LL j=0;j<SZ(ans[i]);j++)writecs(ans[i][j]);
      puts("");
      swap(_a[ans[i][0]][ans[i][1]],_a[ans[i][2]][ans[i][3]]);
    }
    /*    for(LL i=1;i<=n;i++){
      for(LL j=1;j<=n;j++)writecs(_a[i][j]);
      puts("");
    }*/
  }
  return 0;
}