# 目次

• 目次
• 問題
• 解答

# 問題

# 解答

// C++ 14
#include <iostream>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <unordered_map>
#include <math.h>

#define ll long long
#define Int int
#define loop(x, start, end) for(Int x = start; x < end; x++)
#define loopdown(x, start, end) for(int x = start; x > end; x--)
#define rep(n) for(int x = 0; x < n; x++)
#define span(a,x,y) a.begin()+x,a.begin()+y
#define span_all(a) a.begin(),a.end()
#define len(x) (x.size())
#define last(x) (*(x.end()-1))

using namespace std;

int n, pos;
vector<int> in, pre, post;


void rec(int l, int r) {
    if (l >= r) return;
    int root = pre[pos++];
    int m = distance(in.begin(), find(in.begin(), in.end(), root));
    rec(l, m);
    rec(m + 1, r);
    post.push_back(root);
}

void solve() {
    pos = 0;
    rec(0, pre.size());
    int i;
    loop(i, 0, n) {
        if (i) cout << " ";
        cout << post[i];
    }
    cout << endl;
}


int main(void) {
    int x;
    cin >> n;
    loop(i, 0, n) {
        cin >> x;
        pre.push_back(x);
    }
    
    loop(i, 0, n) {
        cin >> x;
        in.push_back(x);
    }
    
    solve();
}