#include <algorithm>
#include <array>
#include <chrono>
#include <fstream>
#include <iostream>
#include <random>

using Board = std::array<std::array<int, 6>, 36>;

class xrand {
    uint64_t x;

   public:
    using result_type = uint32_t;
    static constexpr result_type min() {
        return std::numeric_limits<result_type>::min();
    }
    static constexpr result_type max() {
        return std::numeric_limits<result_type>::max();
    }
    xrand(uint64_t k) : x(k) {}
    xrand() : xrand(1) {}
    result_type operator()() {
        x ^= x << 9;
        x ^= x >> 7;
        return (x * 0x123456789abcdef) >> 32;
    }
};

double calc_score(const Board &board, const std::array<bool, 36> &used) {
    std::array<std::array<double, 6>, 6> prob_row, prob_col;
    std::array<std::array<double, 6>, 6> count_row, count_col;
    for (int i = 0; i < 6; i++) {
        prob_row[i].fill(1.);
        prob_col[i].fill(1.);
        count_row[i].fill(0);
        count_col[i].fill(0);
    }

    for (int row = 0; row < 6; row++) {
        for (int col = 0; col < 6; col++) {
            const int idx = 6 * row + col;
            double p_row = 1., p_col = 1.;
            if (not used[idx]) {
                for (int type = 0; type < 6; type++) {
                    if (prob_row[row][type]) {
                        p_row *= 5. / 6.;
                    }
                    if (prob_col[col][type]) {
                        p_col *= 5. / 6.;
                    }
                }
            }
            for (int type = 0; type < 6; type++) {
                if (not used[idx]) {
                    prob_row[row][type] *= pow(p_row, 1. / 6.);
                    prob_col[col][type] *= pow(p_col, 1. / 6.);
                    count_row[row][type] += 46656. / 31031.;
                    count_col[col][type] += 46656. / 31031.;
                } else if (board[idx][type] == 0) {
                    prob_row[row][type] = 0.;
                    prob_col[col][type] = 0.;
                } else {
                    count_row[row][type] += board[idx][type];
                    count_col[col][type] += board[idx][type];
                }
            }
        }
    }

    double s = 0;
    for (int i = 0; i < 6; i++) {
        for (int type = 0; type < 6; type++) {
            s += prob_row[i][type] * (count_row[i][type] - 3);
            s += prob_col[i][type] * (count_col[i][type] - 3);
        }
    }

    return s;
}

int main() {
    xrand rng;
    std::uniform_int_distribution<> dist(0, 5);

    Board board;
    for (int i = 0; i < 36; i++) {
        board[i].fill(0);
    }
    std::array<bool, 36> used;
    used.fill(false);
    for (int i = 0; i < 35; i++) {
        std::array<int, 6> dice;
        dice.fill(0);
        for (int j = 0; j < 6; j++) {
            int d;
            std::cin >> d;
            d--;
            dice[d]++;
        }
        std::array<double, 36> score;
        score.fill(0);
        for (int j = 0; j < 36; j++) {
            if (used[j]) {
                score[j]--;
                continue;
            }
            Board board_new = board;
            board_new[j] = dice;
            used[j] = true;
            score[j] = calc_score(board_new, used);
            used[j] = false;
        }
        int idx = std::max_element(score.begin(), score.end()) - score.begin();
        std::cerr << score[idx] << std::endl;
        std::cout << idx / 6 + 1 << ' ' << idx % 6 + 1 << std::endl;
        used[idx] = true;
        board[idx] = dice;
    }
    return 0;
}