#include <iostream>

#include <cstdio>

#include <cstdlib>

#include <cmath>

#include <string>

#include <cstring>

#include <algorithm>

#include <vector>

#include <queue>

using namespace std;

typedef long long ll;

typedef unsigned long long ull;

const int inf=0x3f3f3f3f;

const int maxn=;

int n;

int mid[maxn],po[maxn];

struct node{

    int l,r;

}T[maxn];

int mid_po_build(int la,int ra,int lb,int rb){

    if(la>ra) return ;

    int rt=po[rb];

    int p1=la,p2;

    while(mid[p1]!=rt) p1++;

    p2=p1-la;

    T[rt].l=mid_po_build(la,p1-,lb,lb+p2-);

    T[rt].r=mid_po_build(p1+,ra,lb+p2,rb-);

    return rt;

}

void dfs(int rt){

    queue<int>Q;

    vector<int>v;

    Q.push(rt);

    while(!Q.empty()){

        int w=Q.front();

        Q.pop();

        v.push_back(w);

        if(T[w].l!=) Q.push(T[w].l);

        if(T[w].r!=) Q.push(T[w].r);

    }

    int len=v.size();

    for(int i=;i<len;i++){

        printf("%d%c",v[i],i==(len-)?'\n':' ');

    }

}

int main(){

    scanf("%d",&n);

    for(int i=;i<n;i++) scanf("%d",&po[i]);

    for(int i=;i<n;i++) scanf("%d",&mid[i]);

    int rt=mid_po_build(,n-,,n-);

    dfs(rt);

    return ;

}