#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();

    rep(i, n) rep(k, len) d[i].vec[k] = 1;
    rep(i, len) rep(j, len) board[i][j] = n - 1;

    int scr = 0;
    vi<bool> used(n);
    rep(i, n - 1) {
        rep(j, len) d[i].vec[j] = 0;

        rep(j, len) {
            int t;
            cin >> t;
            t--;
            d[i].vec[t]++;
        }

        int pos = -1;
        scr = -inf;
        rep(j, n) {
            if (used[j]) continue;
            board[j / len][j % len] = i;
            int ts = score();
            if (ts > scr) {
                scr = ts;
                pos = j;
            }
            board[j / len][j % len] = n - 1;
        }
        used[pos] = true;
        board[pos / len][pos % len] = i;
        cout << pos / len + 1 << " " << pos % len + 1 << endl;
    }


    return 0;
}