#include <bits/stdc++.h>
#define pii pair<int, int>
#define fi first
#define se second
using namespace std;
const int N = 205;

char buf[1 << 23], *p1 = buf, *p2 = buf;
#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1 ++)
int read() {
	int s = 0, w = 1; char ch = getchar();
	while(!isdigit(ch)) { if(ch == '-') w = -1; ch = getchar(); }
	while(isdigit(ch)) s = s * 10 + (ch ^ 48), ch = getchar();
	return s * w;
}

mt19937 rnd(1145141);
vector<pii> vec[N];
int ans[N][N], matchl[N], matchr[N];
int T, n;

void getmatch(int round) {
	memset(matchr, 0, sizeof(matchr)); 
	for(int i = 1; i <= n; ++ i) {
		static int lst[N];
		vector<int> seq, edge;
		seq.push_back(i);
		
		while(1) {
			int x = seq.back(), t = rnd() % (n - round + 1);
			int r = vec[x][t].se; 
			
			lst[x] = seq.size() - 1;
			edge.push_back(t);
			if(!matchr[r]) break;
			seq.push_back(matchr[r]);
		}
		
		int ptr = 0;
		while(ptr < (int)seq.size()) {
			ptr = lst[seq[ptr]];
			int x = seq[ptr], t = edge[ptr], r = vec[x][t].se;
			matchl[x] = t, matchr[r] = x;
			++ ptr;
		}
	}
	
	for(int i = 1; i <= n; ++ i) 
		ans[i][round] = vec[i][matchl[i]].fi, 
		vec[i].erase(vec[i].begin() + matchl[i]);
}

signed main() {
	T = read();
	while(T --) {
		n = read();
		for(int i = 1; i <= n; ++ i) {
			vec[i].clear();
			for(int j = 1, x; j <= n; ++ j)
				x = read(), vec[i].push_back(pii(j, x)); 
		}
		for(int i = 1; i <= n; ++ i) getmatch(i);
		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", i, ans[i][j], j, ans[j][i]);
	}
	return 0;
}