#include <bits/stdc++.h>
#define fi first
#define se second
#define bit(x) (1LL << (x))
#define getbit(x, i) (((x) >> (i)) & 1)
#define ALL(x) (x).begin(), (x).end()
using namespace std;

template <typename T1, typename T2> bool maxi(T1 &a, T2 b) {
    if (a < b) {a = b; return true;} return false;
}

template <typename T1, typename T2> bool mini(T1 &a, T2 b) {
    if (a > b) {a = b; return true;} return false;
}

const int N = 2e5 + 5;
const int oo = 1e9;
const long long ooo = 1e18;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n; cin >> n;
    vector <vector <int>> a(n + 1);
    vector <pair <int, int>> ans;
    for (int i = 0; i <= n; i++) {
        for (int j = 0; j < 3; j++) {
            int x; cin >> x;
            if (x > 0) {
                a[i].push_back(x);
            }
        }
    }  

    for (int i = 0; i < n; i++) {
        int j = i + 1;
        while (a[i].size() < 3) {
            while (a[j].size() == 0)
                j++;
            ans.push_back({j, i});
            a[i].push_back(a[j].back());
            a[j].pop_back();
        }
        assert(a[i].size() == 3);
    }
    assert(a[n].size() == 0);

    auto print = [&]() {
        for (int i = 0; i <= n; i++) {
            for (int j = 0; j < 3; j++) {
                cerr << ((j < (int) a[i].size()) ? a[i][j] : 0) << " ";
            }
            cerr << "\n";   
        }
        cerr << "\n";
    };

    auto move = [&](int i, int j) {
        ans.push_back({i, j});
        a[j].push_back(a[i].back());
        a[i].pop_back();
    };

    vector <bool> done(n + 1);
    for (int rep = 0; rep + 1 < n; rep++) {
        // cerr << rep << "\n";
        vector <int> sum(n + 1);
        int free = 0;
        for (int i = 0; i <= n; i++) if (!done[i]) {
            if (a[i].size() == 0) {
                free = i;
            } else {
                for (int j = 0; j < 3; j++) 
                    sum[a[i][j]] += 3 - j;
            }
        }

        vector <int> s;
        int fir = 0;
        while (done[fir] || fir == free || sum[a[fir].back()] >= 7) {
            // cerr << '.';
            fir++;
        }

        s.push_back(fir);
        move(fir, free);
        for (int i = 0; i <= n; i++) if (i != free && a[i].back() == a[free].back()) {
            move(i, free);
            s.push_back(i);
            break;
        }



        if (a[free].size() == 1) {
            for (int i = 0; i <= n; i++) if (a[i][1] == a[free].back()) {
                move(i, s.back());
                s.pop_back();

                move(i, free);

                s.push_back(i);
                s.push_back(i);
                break;
            }
        }

        for (int i = 0; i <= n; i++) if (i != free) {
            int found = false;
            for (int j = 0; j < (int) a[i].size(); j++) {
                if (a[i][j] == a[free].back()) {
                    found = true;
                }
            }
            
            if (found) {
                while (a[i].back() != a[free].back()) {
                    // cerr << a[free].back();
                    for (int j = 0; j < 2; j++) {
                        if (s[j] != i) {
                            move(i, s[j]);
                            s[j] = i;
                            break;                        
                        }
                    }    
                }

                move(i, free);
                s.push_back(i);
                break;
            }
        }

        sort(ALL(s));
        done[free] = true;
        if (s[0] == s[2])
            continue;
        if (s[0] == s[1]) {
            move(s[0], s[2]);
        } else if (s[1] == s[2]) {
            move(s[2], s[0]);
        } else {
            move(s[0], s[2]);
            move(s[0], s[1]);
        }

        // print();
    }   

    cout << ans.size() << "\n";
    for (auto &[x, y] : ans) {
        cout << x + 1 << " " << y + 1 << "\n";
    }

    // print();
}