#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <set>
#include <ctime>
#include <random>
#include <cmath>
using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)

template<class T>
using vi = vector<T>;

template<class T>
using vii = vector<vi<T>>;

template<class T>
using viii = vector<vii<T>>;

using pii = pair<int, int>;

int n = 36;
const int len = 6;
const int TL = 1 * 1000;
const int TL2 = 2 * 1000;
const int inf = 1e9;

struct dice {
    vi<int> vec;
    int idx = 0;
    dice() : vec(len), idx(0) {}
};

vi<dice> d(n);
vii<int> board(len, vi<int>(len));

int score() {
    const int inf = 1e9;
    int res = 0;
    rep(i, len) {
        vi<int> cnt(len, 0);
        rep(j, len) {
            rep(k, len) { //どの値
                int pos = board[i][j];
                int num = d[pos].vec[k];
                if (num) cnt[k] += num;
                else cnt[k] = -inf;
            }
        }

        rep(k, len) {
            if (cnt[k] > 0) res += 3 + cnt[k] - 6;
        }
    }

    rep(j, len) {
        vi<int> cnt(len, 0);
        rep(i, len) {
            rep(k, len) { //どの値
                int pos = board[i][j];
                int num = d[pos].vec[k];
                if (num) cnt[k] += num;
                else cnt[k] = -inf;
            }
        }

        rep(k, len) {
            if (cnt[k] > 0) res += 3 + cnt[k] - 6;
        }
    }

    return res * 1000;
}

void inv() {
    rep(i, len) rep(j, i) {
        swap(board[i][j], board[j][i]);
    }
    return;
}

int main()
{
    random_device rnd;
    clock_t start = clock();
    
    int scr = 0;
    vii<bool> used(len, vi<bool>(len));

    rep(i, n - 1) {
        vi<int> d(len);
        rep(j, len) cin >> d[j];
        rep(j, len) d[j]--;

        vi<int> cnt(len);
        bool ok = false;
        rep(j, len) cnt[d[j]]++;
        rep(j, len) if (cnt[j] >= 3 && !used[j][j]) {
            cout << j + 1 << " " << j + 1 << endl;
            used[j][j] = true;
            ok = true;
            break;
        }

        if (ok) continue;

        map<pii, int> mp;
        rep(j, len) rep(k, j) mp[{min(d[j], d[k]), max(d[j], d[k])}]++;

        vi<pair<int, pii>> d2;
        for (auto elem : mp) d2.push_back({ elem.second, elem.first });
        sort(d2.begin(), d2.end(), greater<pair<int, pii>>{});

        for (auto elem : d2) {
            int x = elem.second.first, y = elem.second.second;
            if (!used[x][y]) {
                cout << x + 1 << " " << y + 1 << endl;
                used[x][y] = true;
                ok = true;
                break;
            }
            else if (!used[y][x]) {
                cout << y + 1 << " " << x + 1 << endl;
                used[y][x] = true;
                ok = true;
                break;
            }
        }

        if (ok) continue;

        rep(j, len) {
            rep(k, len) {
                if (!used[j][k]) {
                    cout << j + 1 << " " << k + 1 << endl;
                    used[j][k] = true;
                    ok = true;
                    break;
                }
            }
            if (ok) break;
        }
    }

    return 0;
}