#include <bits/stdc++.h>

#define rep(i, a, b) for (int i = (a); i <= (b); i ++)
#define dep(i, a, b) for (int i = (a); i >= (b); i --)

using namespace std;
const int N = 205;

int T, n, m, a[N][N];
int ans[N][N], mc[N << 1], vis[N << 1];
vector <int> G[N << 1];

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;
}

int dfs(int u) {  
  for (auto v : G[u]) if (!vis[v]) {
    vis[v] = 1;
    if (!mc[v] || dfs(mc[v])) return mc[u] = v, mc[v] = u, 1;
  }
  return 0;
}

void sol() {
  n = read(), m = n << 1;
  rep(i, 1, n) rep(j, 1, n) a[i][j] = read();
  rep(_, 1, n) {
    rep(i, 1, m) G[i].clear(), mc[i] = 0;
    rep(i, 1, n) rep(j, 1, n) if (a[i][j])
      G[a[i][j] + n].emplace_back(i),
      G[i].emplace_back(a[i][j] + n);
    rep(i, 1, n) {
      rep(i, 1, m) vis[i] = 0;
      dfs(i);
    }
    rep(i, 1, n) rep(j, 1, n) if (mc[i] - n == a[i][j])
      {a[i][j] = 0, ans[i][_] = j; break;}
  }
  cout << (n * (n - 1) >> 1) << '\n';
  rep(i, 1, n) rep(j, i + 1, n)
    cout << i << ' ' << ans[i][j] << ' ' << j << ' ' << ans[j][i] << '\n';
}

int main() {
  ios::sync_with_stdio(0), cin.tie(0);
  int T = read();
  while (T --) sol();
  return 0;
}