#include <bits/stdc++.h>

const int max_n = 205;
const int inf32 = 1e9 + 5;

int n, a[max_n][max_n], b[max_n][max_n];

struct Edge {int u, v, next, w;};
Edge edge[1000005];
int s, t, node_count, edge_count, head[1000005];
void AddEdge(int u, int v, int w) {
    edge[++edge_count] = {u, v, head[u], w};
    head[u] = edge_count;
    edge[++edge_count] = {v, u, head[v], 0};
    head[v] = edge_count;
}
int level[1000005];
bool Bfs() {
    std::queue<int> que;
    for (int i = 1; i <= node_count; i++) level[i] = -1;
    level[s] = 0;
    que.push(s);
    while (que.size()) {
        int u = que.front();
        que.pop();
        for (int i = head[u]; i; i = edge[i].next) {
            int v = edge[i].v, w = edge[i].w;
            if (!w) continue;
            if (level[v] != -1) continue;
            level[v] = level[u] + 1;
            que.push(v);
        }
    }
    return level[t] != -1;
}
int _head[1000005];
int Dfs(int u, int flow) {
    if (u == t) return flow;
    int rest = flow;
    for (int i = _head[u]; rest && (_head[u] = i); i = edge[i].next) {
        int v = edge[i].v, w = edge[i].w;
        if (!w) continue;
        if (level[v] != level[u] + 1) continue;
        int now = Dfs(v, std::min(rest, w));
        rest -= now;
        edge[i].w -= now;
        edge[i ^ 1].w += now;
    }
    return flow - rest;
}
int Dinic() {
    int flow = 0;
    while (Bfs()) {
        for (int i = 1; i <= node_count; i++) _head[i] = head[i];
        flow += Dfs(s, inf32);
    }
    return flow; 
}

void Match(int row) {
    edge_count = 1;
    node_count = n * 2 + 2;
    s = n * 2 + 1, t = n * 2 + 2;
    for (int i = 1; i <= node_count; i++) head[i] = 0;
    for (int i = 1; i <= n; i++) {
        AddEdge(s, i, 1);
        AddEdge(i + n, t, 1);
        for (int j = 1; j <= n; j++)
            if (a[i][j])
                AddEdge(i, a[i][j] + n, 1);
    }
    Dinic();
    for (int u = 1; u <= n; u++) {
        for (int i = head[u]; i; i = edge[i].next) {
            if (!edge[i].w) {
                int x = edge[i].v - n;
                for (int j = 1; j <= n; j++)
                    if (a[u][j] == x) {
                        a[u][j] = 0;
                        b[u][row] = j;
                        break;
                    }
                break;
            }
        }
    }
}

int main() {
    int data_count;
    scanf("%d", &data_count);
    for (int data = 1; data <= data_count; data++) {
        scanf("%d", &n);
        for (int i = 1; i <= n; i++)
            for (int j = 1; j <= n; j++)
                scanf("%d", &a[i][j]);
        for (int i = 1; i <= n; i++) Match(i);
        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, b[i][j], j, b[j][i]);
    }
    return 0;
}