#include <bits/stdc++.h>
#define rep(i, p, n) for (ll i = p; i < (ll)(n); i++)
#define rep2(i, p, n) for (ll i = p; i >= (ll)(n); i--)
using namespace std;
using ll = long long;
using ld = long double;
const double pi = 3.141592653589793;
const long long inf = 2 * 1e9;
const long long linf = (1LL << 61);
const ll mod1 = 1000000007;
const ll mod2 = 998244353;
template <class T>
inline bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
inline bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;

#include <atcoder/all>
using namespace atcoder;
using mint1 = modint1000000007;
using mint2 = modint998244353;

vector<pair<ll, ll>> base = {{0, -1}, {-1, 0}, {0, 1}, {1, 0}};

void solve()
{
    ll n;
    cin >> n;
    vector<ll> A(n), B(n), C(n);
    vector<tuple<ll, ll>> D(n);
    rep(i, 0, n)
    {
        cin >> A[i];
    }
    rep(i, 0, n)
    {
        cin >> B[i];
        C[B[i] - 1] = i;
    }
    rep(i, 0, n)
    {
        D[i] = {C[A[i] - 1], A[i]};
    }
    rep(i, 0, n)
    {
        cout << A[i] << " ";
    }
    cout << endl;
    rep(i, 0, n)
    {
        rep(j, 0, n)
        {
            if (i % 2 + j * 2 + 1 < n)
            {
                if (get<0>(D[i % 2 + j * 2]) > get<0>(D[i % 2 + j * 2 + 1]))
                {
                    swap(D[i % 2 + j * 2], D[i % 2 + j * 2 + 1]);
                }
            }
        }
        rep(j, 0, n)
        {
            cout << get<1>(D[j]) << " ";
        }
        cout << endl;
    }
}

int main()
{

    //////////////////
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    //////////////////

    // ll T;
    // cin >> T;
    // while (T--)
    solve();
    return 0;
}