#include <bits/stdc++.h>
using namespace std;
int T, n, a[205][205], used[205][205], id[205][205], p[205][205], match[205], vis[205];
bool dfs(int u) {
	for (int v=1; v<=n; v++)
		if (id[u][v] && ! vis[v]) {
			vis[v] = 1;	
			if (! match[v] || dfs(match[v]))
				return match[v] = u, 1;
		}
	return 0;
}
int main() {
	cin >> T;
	while (T --) {
		scanf ("%d", &n);
		for (int i=1; i<=n; i++)
			for (int j=1; j<=n; j++)
				scanf ("%d", &a[i][j]), used[i][j] = 0;
		for (int t=1; t<=n; t++) {
			for (int i=1; i<=n; i++)
				for (int j=1; j<=n; j++)
					id[i][j] = match[j] = 0;
			for (int i=1; i<=n; i++)
				for (int j=1; j<=n; j++)
					if (! used[i][j])
						id[a[i][j]][i] = j;
			for (int i=1; i<=n; i++) {
				for (int j=1; j<=n; j++)
					vis[j] = 0;
				assert (dfs(i));
			}
			for (int i=1; i<=n; i++)
				p[i][t] = id[match[i]][i], used[i][p[i][t]] = 1;
		} printf ("%d\n", n * (n - 1) >> 1);
		for (int i=1; i<=n; i++)
			for (int j=i+1; j<=n; j++)
				printf ("%d %d %d %d\n", i, p[i][j], j, p[j][i]);
	}
}