import java.util.Arrays;
import java.util.Scanner;

public class Main {
    private int[][] dice;
    private int[][] table;
    private int[] counts = new int[6];
    private SAState sa = new SAState();
    private int score;
    private int copyIndex;
    private int[][] copyTable;
    private int[][] counts_row = new int[6][6];
    private int[][] counts_column = new int[6][6];
    private int[] part_score_row = new int[6];
    private int[] part_score_column = new int[6];

    public static void main(String[] args) throws Exception {
        new Main().run();
    }

    private void run() {
        solve();
    }

    private void solve() {
        try (final Scanner in = new Scanner(System.in)) {
            table = new int[6][6];
            for (int r = 0; r < 6; r++) {
                Arrays.fill(table[r], -1);
            }

            dice = new int[36][6];
            for (int index = 0; index < 35; index++) {
                for (int j = 0; j < 6; j++) {
                    dice[index][j] = in.nextInt() - 1;
                    if (index == 0 && j == 0) {
                        Constants.watch.init();
                    }
                }

                copyIndex = index;
                for (int i = index + 1; i < 36; i++) {
                    for (int j = 0; j < 6; j++) {
                        dice[i][j] = Constants.RNG.nextInt(6);
                    }
                }

                copyTable = copy(table);
                {
                    int index2 = index;
                    for (int r = 0; r < 6; r++) {
                        for (int c = 0; c < 6; c++) {
                            if (copyTable[r][c] < 0) {
                                copyTable[r][c] = index2++;
                            }
                        }
                    }
                }
                score = calculateScore2();
                multiSA();

                int bestR = -1;
                int bestC = -1;
                for (int r = 0; r < 6; r++) {
                    for (int c = 0; c < 6; c++) {
                        if (copyTable[r][c] == index) {
                            bestR = r;
                            bestC = c;
                        }
                    }
                }

                assert table[bestR][bestC] < 0;
                table[bestR][bestC] = index;

                System.out.println((bestR + 1) + " " + (bestC + 1));
                System.out.flush();
            }
        } catch (Exception e) {
            e.printStackTrace();
        }
    }

    private int[][] copy(int[][] table) {
        int[][] copy = new int[6][6];
        for (int r = 0; r < 6; r++) {
            for (int c = 0; c < 6; c++) {
                copy[r][c] = table[r][c];
            }
        }
        return copy;
    }

    private int[] rank(int[] dice) {
        int[] counts = new int[6];
        for (int i = 0; i < dice.length; i++) {
            counts[dice[i]]++;
        }
        int[] rank = new int[6];
        for (int i = 0; i < counts.length; i++) {
            for (int j = 0; j < counts.length; j++) {
                if (j == i) {
                    continue;
                }
                if (counts[i] < counts[j]) {
                    rank[i]++;
                }
            }
        }
        return rank;
    }

//    private void solve_() {
//        greedy();
////        multiSA();
//    }

//    private void greedy() {
//        table = new int[6][6];
//        bestTable = new int[6][6];
//        for (int i = 0; i < 6; i++) {
//            for (int j = 0; j < 6; j++) {
//                table[i][j] = i * 6 + j;
//            }
//        }
//        score = calculateScore();
//        saveBest();
//    }

//    private void saveBest() {
//        if (score > bestScore) {
//            bestScore = score;
//            for (int r = 0; r < 6; r++) {
//                for (int c = 0; c < 6; c++) {
//                    bestTable[r][c] = table[r][c];
//                }
//            }
//        }
//    }

    private void multiSA() {
        int numRestart = 1;
        double startTime = 0;// Constants.watch.getSecond();
        double endTime = 5e4;
        double remainTime = endTime - startTime;
        double startStartTemperature = 2;
        double endStartTemperature = 1e-9;
        for (double restart = 0; restart < numRestart; restart++) {
            sa.startTime = startTime + remainTime * restart / numRestart;
            sa.endTime = startTime + remainTime * (restart + 1) / numRestart;
            sa.startTemperature = endStartTemperature + (startStartTemperature - endStartTemperature) * ((numRestart - restart) / numRestart);
            sa.endTemperature = 1e-9;
            SA();
//            restoreBest();
        }
    }

    private void SA() {
        sa.init();
        for (;; ++sa.numIterations) {
            if ((sa.numIterations & ((1 << 10) - 1)) == 0) {
                sa.update();
                if (sa.isTLE()) {
                    break;
                }
            }
            mutate();
        }
    }

    private void mutate() {
        change();
    }

    private void change() {
        int v1 = sa.numIterations % 36;
        int r1 = v1 / 6;
        int c1 = v1 % 6;
        if (copyTable[r1][c1] < copyIndex) {
            return;
        }
        int r2 = Constants.RNG.nextInt(6);
        int c2 = Constants.RNG.nextInt(6);
        while ((r2 == r1 && c2 == c1) || (copyTable[r2][c2] < copyIndex)) {
            r2 = Constants.RNG.nextInt(6);
            c2 = Constants.RNG.nextInt(6);
        }
        int current1 = copyTable[r1][c1];
        int current2 = copyTable[r2][c2];
        int before = 0;
        before += part_score_row[r1];
        before += part_score_row[r2];
        before += part_score_column[c1];
        before += part_score_column[c2];
        copyTable[r1][c1] = current2;
        copyTable[r2][c2] = current1;
        int after_r1 = partScoreRow(counts_row, r1);
        int after_r2 = partScoreRow(counts_row, r2);
        int after_c1 = partScoreColumn(counts_column, c1);
        int after_c2 = partScoreColumn(counts_column, c2);
        int after = 0;
        after += after_r1;
        after += after_r2;
        after += after_c1;
        after += after_c2;
        int deltaScore = after - before;
        if (sa.accept(deltaScore)) {
            score += deltaScore;
            part_score_row[r1] = after_r1;
            part_score_row[r2] = after_r2;
            part_score_column[c1] = after_c1;
            part_score_column[c2] = after_c2;
//            saveBest();
        } else {
            copyTable[r1][c1] = current1;
            copyTable[r2][c2] = current2;
        }
    }

    private int calculateScore2() {
        int score = 0;
        for (int r = 0; r < 6; r++) {
            final int partScoreRow = partScoreRow2(counts_row, r);
            part_score_row[r] = partScoreRow;
            score += partScoreRow;
        }
        for (int c = 0; c < 6; c++) {
            final int partScoreColumn = partScoreColumn2(counts_column, c);
            part_score_column[c] = partScoreColumn;
            score += partScoreColumn;
        }
        return score;
    }

    private int partScoreColumn2(int[][] counts_column, int c) {
        Arrays.fill(counts_column[c], 0);
        int mask = (1 << 6) - 1;
        for (int r = 0; r < 6; r++) {
            int index = copyTable[r][c];
            int mask2 = 0;
            for (int i = 0; i < 6; i++) {
                counts_column[c][dice[index][i]]++;
                mask2 |= (1 << dice[index][i]);
            }
            mask &= mask2;
        }
        int part_score = 0;
        for (int i = 0; i < 6; i++) {
            if ((mask & (1 << i)) == 0) {
                continue;
            }
            part_score += 3;
            part_score += counts_column[c][i] - 6;
        }
        return part_score;
    }

    private int partScoreRow2(int[][] counts_row, int r) {
        Arrays.fill(counts_row[r], 0);
        int mask = (1 << 6) - 1;
        for (int c = 0; c < 6; c++) {
            int index = copyTable[r][c];
            int mask2 = 0;
            for (int i = 0; i < 6; i++) {
                counts_row[r][dice[index][i]]++;
                mask2 |= (1 << dice[index][i]);
            }
            mask &= mask2;
        }
        int part_score = 0;
        for (int i = 0; i < 6; i++) {
            if ((mask & (1 << i)) == 0) {
                continue;
            }
            part_score += 3;
            part_score += counts_row[r][i] - 6;
        }
        return part_score;
    }

    private int calculateScore(int[][] table) {
        int score = 0;
        for (int r = 0; r < 6; r++) {
            score += partScoreRow(table, r);
        }
        for (int c = 0; c < 6; c++) {
            score += partScoreColumn(table, c);
        }
        return score;
    }

    private int partScoreColumn(int[][] table, int c) {
        Arrays.fill(counts, 0);
        int mask = (1 << 6) - 1;
        int count_r = 0;
        for (int r = 0; r < 6; r++) {
            int index = table[r][c];
            if (index < 0) {
                continue;
            }
            count_r++;
            int mask2 = 0;
            for (int i = 0; i < 6; i++) {
                counts[dice[index][i]]++;
                mask2 |= (1 << dice[index][i]);
            }
            mask &= mask2;
        }
        int part_score = 0;
        for (int i = 0; i < 6; i++) {
            if ((mask & (1 << i)) == 0) {
                continue;
            }
            if (counts[i] == 0) {
                continue;
            }
            part_score += 3;
            part_score += counts[i] - count_r;
        }
        return part_score;
    }

    private int partScoreRow(int[][] table, int r) {
        Arrays.fill(counts, 0);
        int mask = (1 << 6) - 1;
        int count_c = 0;
        for (int c = 0; c < 6; c++) {
            int index = table[r][c];
            if (index < 0) {
                continue;
            }
            count_c++;
            int mask2 = 0;
            for (int i = 0; i < 6; i++) {
                counts[dice[index][i]]++;
                mask2 |= (1 << dice[index][i]);
            }
            mask &= mask2;
        }
        int part_score = 0;
        for (int i = 0; i < 6; i++) {
            if ((mask & (1 << i)) == 0) {
                continue;
            }
            if (counts[i] == 0) {
                continue;
            }
            part_score += 3;
            part_score += counts[i] - count_c;
        }
        return part_score;
    }

//    private void write() {
//        String[] s = new String[36];
//        for (int i = 0; i < s.length; i++) {
//            s[i] = "";
//        }
//        for (int r = 0; r < 6; r++) {
//            for (int c = 0; c < 6; c++) {
//                s[bestTable[r][c]] = (r + 1) + " " + (c + 1);
//            }
//        }
//        StringBuilder sb = new StringBuilder();
//        for (int i = 0; i < 36; i++) {
//            sb.append(s[i]).append('\n');
//        }
//        System.out.print(sb.toString());
//        System.out.flush();
//    }
}

class SAState {
    public static final boolean useTime = !true;
    public double startTime;
    public double endTime;
    public double time;
    public double startTemperature;
    public double endTemperature;
    public double inverseTemperature;
    public double lastAcceptTemperature;
    public double startRange;
    public double endRange;
    public double range;
    public int numIterations;
    public int validIterations;
    public int acceptIterations;
    private double[] log = new double[32768];

    public SAState() {
        for (int i = 0; i < log.length; i++) {
            log[i] = Math.log((i + 0.5) / log.length);
        }
    }

    public void init() {
        numIterations = 0;
        validIterations = 0;
        acceptIterations = 0;
        startTime = useTime ? Constants.watch.getSecond() : numIterations;
        update();
        lastAcceptTemperature = inverseTemperature;
    }

    public void update() {
        updateTime();
        updateTemperature();
    }

    public boolean useExp = !true;

    public void updateTemperature() {
        if (useExp) {
            double time0to1 = elapsedPercentage(startTime, endTime, time);
            double startY = startTemperature;
            double endY = endTemperature;
            double startX = Math.log(startY);
            double endX = Math.log(endY);
            double xStartToEnd = interpolate(startX, endX, time0to1);
            double temperature = Math.exp(xStartToEnd);
            inverseTemperature = 1.0 / temperature;
        } else {
            double time0to1 = elapsedPercentage(startTime, endTime, time);
            double startY = startTemperature;
            double endY = endTemperature;
            double temperature = interpolate(startY, endY, time0to1);
            inverseTemperature = 1.0 / temperature;
        }
    }

    private double elapsedPercentage(double min, double max, double v) {
        return (v - min) / (max - min);
    }

    private double interpolate(double v0, double v1, double d0to1) {
        return v0 + (v1 - v0) * d0to1;
    }

    public void updateRange() {
        range = endRange + (startRange - endRange) * Math.pow((endTime - time) / (endTime - startTime), 1.0);
    }

    public void updateTime() {
        time = useTime ? Constants.watch.getSecond() : numIterations;
    }

    public boolean isTLE() {
        return time >= endTime;
    }

    public boolean accept(double deltaScore) {
        return acceptB(deltaScore);
    }

    public boolean acceptB(double deltaScore) {
        validIterations++;
        if (deltaScore > -1e-9) {
            acceptIterations++;
            return true;
        }
        double d = deltaScore * inverseTemperature;
        if (d < -10) {
            return false;
        }
        if (log[Constants.RNG.nextInt() & 32767] < d) {
            acceptIterations++;
            lastAcceptTemperature = inverseTemperature;
            return true;
        }
        return false;
    }

    public boolean acceptS(double deltaScore) {
        validIterations++;
        if (deltaScore < 1e-9) {
            acceptIterations++;
            return true;
        }
        double d = -deltaScore * inverseTemperature;
        if (d < -10) {
            return false;
        }
        if (log[Constants.RNG.nextInt() & 32767] < d) {
            acceptIterations++;
            lastAcceptTemperature = inverseTemperature;
            return true;
        }
        return false;
    }
}

final class Utils {
    private Utils() {
    }

    public static final void debug(Object... o) {
        System.err.println(toString(o));
        System.err.flush();
    }

    public static final String toString(Object... o) {
        return Arrays.deepToString(o);
    }

    public static boolean isValid(int v, int min, int minUpper) {
        return v >= min && v < minUpper;
    }
}

class Watch {
    private long start;

    public Watch() {
        init();
    }

    public double getSecond() {
        return (System.nanoTime() - start) * 1e-9;
    }

    public void init() {
        init(System.nanoTime());
    }

    private void init(long start) {
        this.start = start;
    }

    public String getSecondString() {
        return toString(getSecond());
    }

    public static final String toString(double second) {
        if (second < 60) {
            return String.format("%5.2fs", second);
        } else if (second < 60 * 60) {
            int minute = (int) (second / 60);
            return String.format("%2dm%2ds", minute, (int) (second % 60));
        } else {
            int hour = (int) (second / (60 * 60));
            int minute = (int) (second / 60);
            return String.format("%2dh%2dm%2ds", hour, minute % (60), (int) (second % 60));
        }
    }
}

interface Constants {
    Watch watch = new Watch();
    PCG_XSH_RR RNG = new PCG_XSH_RR(System.nanoTime());
}

final class PCG_XSH_RR {
    private long state = 5342;

    public PCG_XSH_RR(final long state) {
        this.state = state;
    }

    public int nextInt() {
        final long oldstate = state;
        state = oldstate * 6364136223846793005L + 521L;
        final int xorshift = (int) (((oldstate >>> 18) ^ oldstate) >>> 27);
        final int rotation = (int) (oldstate >>> 59);
        return (xorshift >>> rotation) | (xorshift << (-rotation & 31));
    }

    public int nextInt(int n) {
        return (int) (n * nextDouble());
    }

    public double nextDouble() {
        return (nextInt() >>> 1) * 4.6566128730773926E-10;
    }
}