#include <bits/stdc++.h>
using namespace std;

#define OK(r, c) (r >= 0 && c >= 0 && r < 9 && c < 9)
#define SQ(r, c) ((r) / 3 + 3 * ((c) / 3))

int gr[9][9], mk[3][9], q[9][9][9][9];

int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};

bool lV(int r, int c) {
    for (int i = 0; i < 4; i++) {
        int x = r + dx[i];
        int y = c + dy[i];
        if (!OK(x, y) || gr[x][y] == 0 || q[r][c][x][y] == 0)
            continue;
        if (q[r][c][x][y] != max(gr[r][c], gr[x][y]) / min(gr[r][c], gr[x][y]))
            return false;
    }
    return true;
}

void add(int r, int c, int x, int s) {
    gr[r][c] = s > 0 ? x : 0;
    mk[0][r] ^= 1 << (x - 1);
    mk[1][c] ^= 1 << (x - 1);
    mk[2][SQ(r, c)] ^= 1 << (x - 1);
}

bool bT(int r, int c) {
    if (r == 9)
        return true;
    int rI = r + (c + 1) / 9;
    int cI = (c + 1) % 9;
    if (gr[r][c])
        return lV(r, c) && bT(rI, cI);
    int mask = mk[0][r] & mk[1][c] & mk[2][SQ(r, c)];
    for (int x = 1; mask >> (x - 1); x++) {
        if ((mask >> (x - 1)) & 1) {
            add(r, c, x, 1);
            if (lV(r, c) && bT(rI, cI))
                return true;
            add(r, c, x, -1);
        }
    }
    return false;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int k;
    cin >> k;
    queue<pair<int, int>> q1, q2;
    for (int i = 0; i < 9; i++) {
        for (int j = 0; j < 9; j++) {
            if (j % 3 != 2) q1.push({i, j});
            if (i % 3 != 2) q2.push({i, j});
        }
    }
    for (int i = 0; i < 3; i++) {
        vector<int> v = {6, 9, 6, 9, 6};
        for (int t : v) {
            for (int j = 0; j < t; j++) {
                if (t == 6) {
                    auto p = q1.front();
                    q1.pop();
                    cin >> q[p.first][p.second][p.first][p.second + 1];
                    q[p.first][p.second + 1][p.first][p.second] = q[p.first][p.second][p.first][p.second + 1];
                } else {
                    auto p = q2.front();
                    q2.pop();
                    cin >> q[p.first][p.second][p.first + 1][p.second];
                    q[p.first + 1][p.second][p.first][p.second] = q[p.first][p.second][p.first + 1][p.second];
                }
            }
        }
    }
    for (int i = 0; i < 3; i++)
        for (int j = 0; j < 9; j++)
            mk[i][j] = 511;
    while (k--) {
        int r, c, x;
        cin >> r >> c >> x;
        r -= 1;
        c -= 1;
        add(r, c, x, 1);
    }
    bT(0, 0);
    for (int i = 0; i < 9; i++) {
        for (int j = 0; j < 9; j++)
            cout << gr[i][j] << " ";
        cout << "\n";
    }
}