#include <bits/stdc++.h>
#define PB push_back
#define EB emplace_back
using namespace std;
const int maxn = 200;
int a[maxn + 5][maxn + 5];
bool vis[maxn + 5][maxn + 5];
int id[maxn + 5][maxn + 5];
struct edge { int v, f; };
vector<edge> e;
vector<int> g[2 * maxn + 5];
inline void addE(int u, int v) {
	g[u].PB(e.size()), e.PB({v, 1});
	g[v].PB(e.size()), e.PB({u, 0});
}
int S, T;
int d[2 * maxn + 5], cur[2 * maxn + 5];
bool bfs(int s, int t) {
	memset(d + 1, 127, T * sizeof(int)), memset(cur + 1, 0, T * sizeof(int));
	queue<int> q;
	q.push(s), d[s] = 0;
	while (!q.empty()) {
		int u = q.front(); q.pop();
		for (int eid : g[u]) {
			int v = e[eid].v, f = e[eid].f;
			if (f && d[v] > T) {
				q.push(v), d[v] = d[u] + 1;
				if (v == t) return 1;
			}
		}
	}
	return 0;
}
int dfs(int u, int fl, int t) {
	if (u == t) return fl;
	int rs = 0;
	for (int i = cur[u]; i < g[u].size(); i++) {
		cur[u] = i;
		int eid = g[u][i], v = e[eid].v, f = e[eid].f;
		if (f && d[v] == d[u] + 1) {
			int nf = dfs(v, min(fl, f), t);
			e[eid].f -= nf, e[eid ^ 1].f += nf;
			fl -= nf, rs += nf;
			if (!fl) break;
		}
	}
	return rs;
}
int dinic(int s, int t) {
	int rs = 0;
	while (bfs(s, t)) rs += dfs(s, INT_MAX, t);
	return rs;
}
int main() {
	int C;
	scanf("%d", &C);
	while (C--) {
		int n;
		scanf("%d", &n);
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= n; j++) scanf("%d", &a[i][j]);
		S = n * 2 + 1, T = S + 1;
		for (int t = 1; t <= n; t++) {
			fill(g + 1, g + T + 1, vector<int>());
			e.clear();
			for (int i = 1; i <= n; i++) addE(S, i), addE(i + n, T);
			for (int i = 1; i <= n; i++)
				for (int j = 1; j <= n; j++)
					if (!vis[i][j]) addE(i, n + a[i][j]);
			dinic(S, T);
			for (int i = 1; i <= n; i++)
				for (int eid : g[i]) {
					int j = e[eid].v, f = e[eid].f;
					if (j != S && !f) {
						for (int k = 1; k <= n; k++)
							if (!vis[i][k] && a[i][k] == j - n) {
								id[i][t] = k, vis[i][k] = 1;
								break;
							}
						break;
					}
				}
		}
		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, id[i][j], j, id[j][i]);
	}
}