#include <bits/stdc++.h>
#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
#define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++)
#define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el '\n'
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define inp(x) for(auto &i:x)cin>>i
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using i128 = __int128_t;
using boost::multiprecision::cpp_int;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;

    vi A(n), B(n), idx(n + 1);
    for (auto &x : A) cin >> x;
    for (auto &x : B) cin >> x;

    rep(i, 0, n) idx[B[i]] = i;

    vector<vi> ans(n + 1, vi(n));
    ans[0] = A;
    ans[n] = B;

    rep(i, 0, n - 1) {
        ans[i + 1] = ans[i];

        for (int j = i % 2; j + 1 < n; j += 2) {
            if (idx[ans[i + 1][j]] >
                idx[ans[i + 1][j + 1]]) {
                swap(ans[i + 1][j], ans[i + 1][j + 1]);
            }
        }
    }

    rep(i, 0, n + 1) {
        rep(j, 0, n) {
            if (j) cout << ' ';
            cout << ans[i][j];
        }
        cout << '\n';
    }
}