// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#define Debug(x...) _debug_print_format(#x, x);
std::ifstream terminal("/dev/tty");
#define PP cerr<<"\033[1;30mpause...\e[0m",terminal.ignore();
#else
#define debug(x...)
#define Debug(x...)
#define PP
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define FIND(a, x) ((find(a.begin(),a.end(),(x))!=a.end())?1:0)
#define cmin(x,...) x=min({(x),__VA_ARGS__})
#define cmax(x,...) x=max({(x),__VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define NaN (int)(0x8b88e1d0595d51d1)
#define double long double
#define int long long
#define uint unsigned long long
#define MAXN 200010

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

    int n; cin >> n;
    vector<vector<int>> e(n+1, vector<int>(2, 0));
    vector<int> pre(n), in(n), parent(n+1), pos(n+1);
    rep(i, 0, n) cin >> pre[i];
    rep(i, 0, n) cin >> in[i];
    rep(i, 0, n) pos[in[i]] = i;
    function<int(int, int, int, int)> solve = [&](int pl, int pr, int il, int ir) -> int {
        if (pl > pr) return 0;
        int root = pre[pl];
        int idx = pos[root] - il;
        int lc = solve(pl+1, pl+1+idx-1, il, il+idx);
        int rc = solve(pl+1+idx, pr, il+idx+1, ir);
        e[root][0] = lc, e[root][1] = rc;
        parent[lc] = parent[rc] = root;
        return root;
    };
    solve(0, n-1, 0, n-1);
    int root = -1;
    rep(i, 1, n+1) if (!parent[i]) {root = i; break; }
    vector<int> post;
    function<void(int)> dfs = [&](int u) {
        if (e[u][0]) dfs(e[u][0]);
        if (e[u][1]) dfs(e[u][1]);
        post.push_back(u);
    };
    dfs(root);
    rep(i, 0, sz(post)) cout << post[i] << " \n"[i==sz(post)-1];

    return 0;
}