#include <bits/stdc++.h>

using namespace std;

const int N = 2010;

int a[N][N];

struct Node {
    int s, x, z, y;
}e[N];

bool b[N];
int S, X, Z, Y;
int n;

void dfs(int x, int i, int j) {
    if(b[x]) return;
    b[x] = 1;

    if(e[x].s != -1 && !b[e[x].s]) {
        a[i - 1][j] = e[x].s;
        S = min(S, i - 1);

        dfs(e[x].s, i - 1, j);
    }
    if(e[x].x != -1 && !b[e[x].x]) {
        a[i + 1][j] = e[x].x;
        // cout << a[i + 1][j] << endl;
        X = max(X, i + 1);

        dfs(e[x].x, i + 1, j);
    }
    if(e[x].z != -1 && !b[e[x].z]) {
        a[i][j - 1] = e[x].z;
        Z = min(Z, j - 1);

        dfs(e[x].z, i, j - 1);
    }
    if(e[x].y != -1 && !b[e[x].y]) {
        a[i][j + 1] = e[x].y;
        Y = max(Y, j + 1);

        dfs(e[x].y, i, j + 1);
    }
}

int main() {
    memset(a, -1, sizeof a);
    memset(b, 0, sizeof b);

    X = S = Z = Y = 1001;

    cin >> n;
    for(int i = 1; i <= n; i ++)
        cin >> e[i].s >> e[i].x >> e[i].z >> e[i].y;
    
    // a[1001][1001] = 1;
    dfs(1, 1001, 1001);
    // cout << S << " " << X << " " << Z << " " << Y << endl;
    a[1001][1001] = 1;

    for(int i = S; i <= X; i ++) {
        for(int j = Z; j <= Y; j ++)
            cout << a[i][j] << (j == Y ? "\n" : " ");
        // cout << endl;
    }
}