#if __has_include("../library/Basic/Debug.hpp")

#include "../library/Basic/Debug.hpp"

#else

/* ----- Header Files ----- */
// IO
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>

// algorithm
#include <algorithm>
#include <cmath>
#include <numeric>

// container
#include <vector>
#include <string>
#include <tuple>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>

// others
#include <random>
#include <limits>
#include <functional>
#include <ctime>
#include <cassert>
#include <cstdint>


/* ----- Type Alias ----- */
using Int = long long int;
using Real = long double;
using String = std::string;
template <class... Ts>
using Tuple = std::tuple<Ts...>;

template <class T>
using Vector = std::vector<T>;
template <class T>
using Queue = std::queue<T>;
template <class T>
using Stack = std::stack<T>;
template <class T>
using Deque = std::deque<T>;

template <class T>
using MaxHeap = std::priority_queue<T>;
template <class T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <class T>
using Set = std::set<T>;
template <class T, class U>
using Map = std::map<T, U>;

template <class T, class... Us>
using Func = std::function<T(Us...)>;

template <class T>
T genv(T v) { return v; }

template <class T, class... Ts>
auto genv(size_t l, Ts... ts) {
    return Vector<decltype(genv<T>(ts...))>(l, Vector<T>(ts...));
}

template <class Cost = Int>
struct Edge {
    Int src, dst;
    Cost cost;
    Edge(Int src = -1, Int dst = -1, Cost cost = 1)
        : src(src), dst(dst), cost(cost){};

    bool operator<(const Edge<Cost>& e) const { return this->cost < e.cost; }
    bool operator>(const Edge<Cost>& e) const { return this->cost > e.cost; }
};

template <class Cost = Int>
using Edges = Vector<Edge<Cost>>;
template <class Cost = Int>
using Graph = Vector<Vector<Edge<Cost>>>;

#endif

/* ----- Misc ----- */
void fastio() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
}

struct Fout {
    Int precision;
    Fout(Int precision) : precision(precision) {}
};
std::ostream& operator<<(std::ostream& os, const Fout& fio) {
    os << std::fixed << std::setprecision(fio.precision);
    return os;
}


/* ----- Constants ----- */
// constexpr Int INF = std::numeric_limits<Int>::max() / 3;
// constexpr Int MOD = 1000000007;
// constexpr Real PI = acos(-1);
// constexpr Real EPS = 1e-10;
// std::mt19937 mt(int(std::time(nullptr)));

const Vector<Int> dx({-1, 0}), dy({0, -1});

int main() {
    Int n;
    std::cin >> n;

    Vector<Vector<Int>> adj(n * n);
    for (Int i = 0; i < 2 * n * (n - 1); ++i) {
        Int u, v;
        std::cin >> u >> v;
        --u, --v;

        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    Vector<Vector<Int>> ans(n, Vector<Int>(n, -1));
    Vector<bool> used(n * n, false);
    for (Int v = 0; v < n * n; ++v) {
        if (adj[v].size() < 4) {
            adj[v].push_back(-1);
        }
        if (adj[v].size() < 4) {
            ans[0][0] = v;
        }
    }
    used[ans[0][0]] = true;

    for (Int x = 0; x < n; ++x) {
        for (Int y = 0; y < n; ++y) {
            if (x == 0 && y == 0) continue;

            Vector<Int> adjs;
            for (Int i = 0; i < 2; ++i) {
                Int nx = x + dx[i], ny = y + dy[i];
                if (nx < 0 || ny < 0) {
                    adjs.push_back(-1);
                } else {
                    adjs.push_back(ans[nx][ny]);
                }
            }

            for (Int v = 0; v < n * n; ++v) {
                if (used[v]) continue;
                bool judge = true;
                for (auto a : adjs) {
                    if (!std::count(adj[v].begin(), adj[v].end(), a)) {
                        judge = false;
                    }
                }

                if (judge) {
                    ans[x][y] = v;
                    used[v] = true;
                    break;
                }
            }
        }
    }

    for (Int x = 0; x < n; ++x) {
        for (Int y = 0; y < n; ++y) {
            std::cout << ans[x][y] + 1 << " \n"[y == n - 1];
        }
    }
    return 0;
}



Measured memory_bytes: 3848