#include <bits/stdc++.h>

using namespace std;

using LL = long long;
using i128 = __int128_t;
using PII = pair<int, int>;

const LL LINF = 0x3f3f3f3f3f3f3f3f;
const int INF = 0x3f3f3f3f;

void solve()
{
    int n;
    cin >> n;

    int bg;
    vector<int> rt(n * n + 1), dw(n * n + 1);
    for(int i = 1; i <= n * n; i ++ )
    {
        bool ok = false;
        vector<int> dir(4);
        for(int j = 0; j < 4; j ++ ) cin >> dir[j];

        if(dir[0] == -1 and dir[2] == -1) bg = i;

        rt[i] = dir[3];
        dw[i] = dir[1];
    }

    int ni = bg;
    int cnt = 0;
    while(ni ^ -1)
    {
        int nj = ni;
        while(nj ^ -1)
        {
            cout << nj << ' ';
            nj = rt[nj];
            // cnt ++ ;
            // if(cnt > 100) return;
        }
        ni = dw[ni];
        cout << endl;
    }
}
 
int main()  
{
    int T;

    solve();

    return 0;
}