#include <bits/stdc++.h>
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
template <typename T> void chkmin(T &x, T y) { x = min(x, y); }
template <typename T> void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
	x *= f;
}
const int N = 210;
vector <pair <int, int>> v[N];
int a[N][N], to[N], b[N][N];
bool vis[N];
bool match(int x) {
	// cout << "-> " << x << endl;
	vis[x] = true;
	for (auto [i, j]: v[x]) {
		if (vis[to[i]]) continue;
		if (!to[i] || match(to[i])) {
			to[i] = x;
			return true;
		}
	} return false;
}
void work() {
	int n; read(n);
	F(i, 1, n)
		F(j, 1, n) {
			int x; read(x);
			v[i].emplace_back(x, j);
		}
	F(i, 1, n) {
		// cout << "!! " << i << endl;
		ms(to, 0);
		F(j, 1, n) {
			// cout << "!!! " << j << endl;
			ms(vis, false);
			assert(match(j));
			// cout << "!!! " << j << endl;
		}
		// cout << "! " << i << endl;
		F(j, 1, n) {
			int k = to[j];
			// cout << " - > " << j << " " << k << endl;
			for (auto it = v[k].begin(); it != v[k].end(); it++) {
				if (it -> first == j) {
					// cout << it -> first << " " << it -> second << endl;
					// b[k][it -> second] = i;
					b[k][i] = it -> second;
					v[k].erase(it);
					break;
				}
			}
			// puts("ok");
		}
		// puts("ook");
	}
	// F(i, 1, n) {
	// 	F(j, 1, n)
	// 		cout << b[i][j] << " ";
	// 	cout << endl;
	// }
	// puts("oook");
	cout << n * (n - 1) / 2 << endl;
	F(i, 1, n)
		F(j, i + 1, n)
			cout << i << " " << b[i][j] << " " << j << " " << b[j][i] << endl;
}
signed main() {
	int _; read(_);
	while (_--) work();
	return 0;
}