#include <bits/stdc++.h>
using namespace std;

struct FastIO {
	inline FastIO& operator >> (short& x) {
		x = 0;
		char f = 0, ch = getchar();
		while (ch > '9' || ch < '0') f |= (ch == '-'), ch = getchar();
		while (ch <= '9' && ch >= '0') x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
		return x = (f ? -x : x), *this;
	}
	inline FastIO& operator >> (int& x) {
		x = 0;
		char f = 0, ch = getchar();
		while (ch > '9' || ch < '0') f |= (ch == '-'), ch = getchar();
		while (ch <= '9' && ch >= '0') x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
		return x = (f ? -x : x), *this;
	}
	inline FastIO& operator >> (long long& x) {
		x = 0;
		char f = 0, ch = getchar();
		while (ch > '9' || ch < '0') f |= (ch == '-'), ch = getchar();
		while (ch <= '9' && ch >= '0') x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar();
		return x = (f ? -x : x), *this;
	}
	inline FastIO& operator >> (double& x) {
		x = 0;
		char f = 0, ch = getchar();
		double d = 0.1;
		while (ch > '9' || ch < '0') f |= (ch == '-'), ch = getchar();
		while (ch <= '9' && ch >= '0') x = x * 10 + (ch ^ 48), ch = getchar();
		if (ch == '.') {
			ch = getchar();
			while (ch <= '9' && ch >= '0') x += d * (ch ^ 48), d *= 0.1, ch = getchar();
		}
		return x = (f ? -x : x), *this;
	}
} rin;

#define endl "\n"

struct NetworkFlow {
	int n, m, s, t;
	int inf; 
	int tot;
	vector<int> head;
	vector<int> c;
	vector<int> ver, Next;
	vector<int> dis;
	vector<int> now;
	vector<bool> del;
	NetworkFlow* newNetworkFlow(int N, int M, int S, int T, int Inf) {
		n = N, m = M, s = S, t = T, inf = Inf, tot = 1;
		const int maxDirEdge = (M << 1) + 10, maxVer = N + 10;
		head.assign(maxVer, 0);
		c.assign(maxDirEdge, 0);
		ver.assign(maxDirEdge, 0);
		Next.assign(maxDirEdge, 0);
		del.assign(maxDirEdge, 0);
		now.assign(maxVer, 0);
		return this;
	}
	inline void addDir(int u, int v, int limFlow) {
		c[++tot] = limFlow;
		ver[tot] = v;
		Next[tot] = head[u];
		head[u] = tot;
	}
	inline void add(int u, int v, int limFlow) {
		addDir(u, v, limFlow);
		addDir(v, u, 0);
	}
	bool bfs() {
		dis.assign(n + 1, inf);
		
		queue<int> q;
		q.push(s), dis[s] = 0, now[s] = head[s];
		
		while (!q.empty()) {
			int u = q.front(); q.pop();
			for (int i = now[u]; i; i = Next[i]) {
				if (del[i]) continue;
				int v = ver[i];
				if (c[i] > 0 && dis[v] == inf) {
					q.push(v);
					now[v] = head[v];
					dis[v] = dis[u] + 1;
					if (v == t) return true;
				}
			}
		}
		return false;
	}
	inline int dfs(int u, int sum) {
		if (u == t) return sum;
		int k, res = 0;
		for (int i = now[u]; i && sum; i = Next[i]) {
			if (del[i]) continue;
			now[u] = i;
			int v = ver[i];
			if (c[i] > 0 && dis[v] == dis[u] + 1) {
				k = dfs(v, min(sum, c[i]));
				if (k == 0) dis[v] = inf;
				c[i] -= k;
				c[i ^ 1] += k;
				res += k;
				sum -= k;
			}
		}
		return res;
	}
	inline int maxFlow() {
		int ret = 0;
		while (bfs()) ret += dfs(s, inf);
		return ret;
	}
};

const int N = 210;
int n, crd[N][N], row[N], ele[N], mat[N][N];
bool chos[N][N];

inline void solve() {
	rin >> n;
	const int S = 1, T = 2;
	int cV = 2;
	NetworkFlow net;
	net.newNetworkFlow((n << 1) + 2, n * n * 3, S, T, 0x3f3f3f);
	for (int i = 1; i <= n; ++i) row[i] = ++cV;
	for (int i = 1; i <= n; ++i) ele[i] = ++cV;
	for (int i = 1; i <= n; ++i)
		for (int j = 1; j <= n; ++j) {
			rin >> crd[i][j], chos[i][j] = false;
			net.add(row[i], ele[crd[i][j]], 1);
		}
	for (int t = 1; t <= n; ++t) {
		for (int i = 1; i <= n; ++i) net.add(S, row[i], 1);
		for (int i = 1; i <= n; ++i) net.add(ele[i], T, 1);
		net.maxFlow();
		for (int i = 1; i <= n; ++i)
			for (int e = net.head[row[i]]; e; e = net.Next[e]) {
//					cout << row[i] << " -> " << net.ver[e] << " " << net.c[e] << endl;
					if (!net.del[e] && !net.c[e] && net.ver[e] != S) {
						int j = net.ver[e] - n - 2;
						for (int k = 1; k <= n; ++k)
							if (!chos[i][k] && crd[i][k] == j) {
								chos[i][k] = true;
								mat[i][t] = k;
								break;
							}
						break;
					}
				}
		for (int e = 1; e <= net.tot; ++e)
			if (!(e & 1) && !net.c[e]) net.del[e] = net.del[e ^ 1] = true;
//		for (int i = 1; i <= n; ++i) cout << mat[i][t] << " ";
//		cout << endl;
	}
	cout << n * (n - 1) / 2 << endl;
	for (int i = 1; i <= n; ++i)
		for (int j = i + 1; j <= n; ++j)
			cout << i << " " << mat[i][j] << " " << j << " " << mat[j][i] << endl;
}

signed main() {
	int T;
	rin >> T;
	while (T--) solve();
	return 0;
}