/**
	author:  shobonvip
	created: 2026.09.19 15:59:35
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)
#define all(v) v.begin(), v.end()

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n; cin >> n;
//	rep(num,0,10){
	vector<int> a(n), b(n);
//	iota(all(a),0);
//	iota(all(b),0);
//	shuffle(all(b),random_device());
	rep(i,0,n) { cin >> a[i]; a[i]--; }
	rep(i,0,n) { cin >> b[i]; b[i]--; }
//rep(i,0,n)cout<<a[i]<<' ';
//cout<<endl;
//rep(i,0,n)cout<<b[i]<<' ';
//cout<<endl;

	vector<int> p(n);
	rep(i,0,n) {
		p[b[i]] = i;
	}

	vector ans(n+1, vector<int>(n));
	rep(i,0,n) ans[0][i] = a[i];
	rep(i,1,n+1) {
		vector<bool> used(n);
		ans[i] = ans[i-1];
		rep(j,0,n-1) {
			if (j%2!=i%2)continue;
			if (used[j]) continue;
			if (p[ans[i][j]] > p[ans[i][j+1]]) {
				swap(ans[i][j], ans[i][j+1]);
				used[j] = true;
				used[j+1] = true;
			}
		}
	}

	if (ans[n] == b) {
		rep(i,0,n+1) {
			rep(j,0,n) {
				cout << ans[i][j] + 1 ;
				if (j == n-1) cout << '\n';
				else cout << ' ';
			}
		}
	} else {
		rep(i,0,n+1) {
			rep(j,0,n) {
				cout << ans[i][j] + 1 ;
				if (j == n-1) cout << '\n';
				else cout << ' ';
			}
		}
		cout<<flush;
		assert(false);
	}
}