#include<bits/stdc++.h>
using namespace std;
int n,m,q;
const int N = 1e6+10;
const int M = 1e3+10;
struct node{
	int n, s, w, e;
}; node z[N];
int a[M][M];
int main()
{
    int m, flag;
    cin >> m;
    for(int i = 1; i <= m * m; ++i){
    	cin >> z[i].n >> z[i].s >> z[i].w >> z[i].e;
    	if(z[i].w == -1 && z[i].n == -1){
    		flag = i;
    		//cout <<"!"<<endl;
		}
	}
	//cout << flag << endl;
	a[0][0] = flag;
	for(int i = 1; i < m; ++i){
		a[0][i] = z[a[0][i - 1]].e;
		//cout << a[0][i]<<" ";
	}
	//cout << endl;
	for(int i = 1; i < m; ++i){
		for(int j = 0; j < m; ++j){
			a[i][j] = z[a[i - 1][j]].s;
		}
	}
	for(int i = 0; i < m; ++i){
		for(int j = 0; j < m; ++j){
			cout << a[i][j] <<" ";
		}
		cout << '\n';
	}
}