#include<bits/stdc++.h>

using namespace std;

const int N = 1e3 + 5;
int a[N][N];

typedef pair<int, int> pii;
pii pos[N * N];
vector<pair<pii, pii>> ans;

void op(pii p1, pii p2) {
    if (p1 == p2)return;
    assert(p1.first == p2.first || p1.second == p2.second);
    int n1 = a[p1.first][p1.second], n2 = a[p2.first][p2.second];
    swap(pos[n1], pos[n2]);
    swap(a[p1.first][p1.second], a[p2.first][p2.second]);
    ans.emplace_back(p1, p2);
}

int main() {
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < n; j++) {
            cin >> a[i][j];
            a[i][j]--;
            pos[a[i][j]] = {i, j};
        }
    }


    for (int i = 0; i < n; i++) {
        vector<int> cnt(n, 0);
        for (int j = 0; j < n; j++) {
            cnt[pos[i * n + j].second]++;
        }
        queue<int> q;
        for (int j = 0; j < n; j++) {
            if (cnt[j] == 0) {
                q.push(j);
            }
        }

        while (!q.empty()) {
            int u = q.front();
            q.pop();
            int tar = i * n + u;
            cnt[pos[tar].second]--;
            if (cnt[pos[tar].second] == 0) {
                q.push(pos[tar].second);
            }
            op(pos[tar], {pos[tar].first, u});
            op(pos[tar], {i, pos[tar].second});
        }

        for (int j = 0; j < n; j++) {
            op(pos[i * n + j], {i, pos[i * n + j].second});

        }
        for (int j = 0; j < n; j++) {
            op(pos[i * n + j], {pos[i * n + j].first, j});
        }
    }


    cout << ans.size() << "\n";
    for(auto [p1,p2]:ans){
        cout << p1.first +1 <<" " << p1.second +1 <<" " << p2.first+1 <<" " << p2.second+1 <<"\n";
    }
}