#include <bits/stdc++.h>
using namespace std;
map<int,int>M;
int s[31],c[31],l;
void la(int l,int r,int st,int ed,int f)
{if(l<=r&&st<=ed){M[f]=c[ed];for(int i=l; i<=r; i++)if(c[ed]==s[i]){la(l,i-1,st,st+i-1-l,2*f+1),la(i+1,r,st+i-l,ed-1,2*f+2);return ;}}
}
int main()
{cin>>l;for(int i=0;i<l;i++)cin>>c[i];for(int i=0;i<l;i++)cin>>s[i];la(0,l-1,0,l-1,0);int f=0;for(auto X:M){if(f)cout<<" ";cout<<X.second,f=1;}return 0;
}

#include<bits/stdc++.h>
using namespace std;
int post[1000],in[1000],Left[1000],Right[1000];
int n;
int build(int L1,int R1,int L2,int R2)
{if(L1>R1)return 0;int root=post[R1];int pos=L2;while(in[pos]!=root)pos++;int cnt=pos-L2;Left[root]=build(L1,L1+cnt-1,L2,pos-1);Right[root]=build(L1+cnt,R1-1,pos+1,R2);return root;
}
void level()
{queue<int>q;q.push(post[n]);int f=0;while(!q.empty()){int u=q.front();q.pop();if(!f)printf("%d",u),f=1;else printf(" %d",u);if(Left[u])q.push(Left[u]);if(Right[u])q.push(Right[u]);}
}
int main()
{cin>>n;for(int i=1;i<=n;i++)cin>>post[i];for(int i=1;i<=n;i++)cin>>in[i];build(1,n,1,n);level();return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int N=10000005;
int a[N],b[N],n,m;
long long L,R,zws;
int la()
{while(L<=R){int mi=(L+R)>>1;int pos=upper_bound(a,a+n,b[mi])-a;if(pos&&a[pos-1]==b[mi]){if(mi+pos==zws)return mi;}if(mi+pos+1<zws){if(mi==m-1)return -1;L=mi+1;}else if(mi+pos+1>zws){if(mi==0)return -1;R=mi-1;}else
        {return mi;}}return -1;
}
int lb()
{while(L<=R){int mi=(L+R)>>1;int pos=upper_bound(b,b+m,a[mi])-b;if(pos&&b[pos-1]==a[mi]){if(mi+pos==zws)return mi;}if(mi+pos+1<zws){if(mi==n-1)return -1;L=mi+1;}else if(mi+pos+1>zws){if(mi==0)return -1;R=mi-1;}else
        {return mi;}}return -1;
}
int Scan()
{int res = 0, ch, flag = 0;if((ch = getchar()) == '-')
flag = 1;else if(ch >= '0' && ch <= '9')
res = ch - '0';while((ch = getchar()) >= '0' && ch <= '9' )res = res * 10 + ch - '0';return flag ? -res : res;}int main()
{while(~scanf("%d%d",&n,&m)){for(int i=0; i<n; i++)a[i]=Scan();for(int i=0; i<m; i++)b[i]=Scan();L=0,R=m-1,zws=(n+m+1)/2;int t=la();if(t==-1)L=0,R=n-1,t=lb(),t=a[t];else t=b[t];if((n+m)%2==0){zws++;L=0,R=m-1;int t1=la();if(t1==-1)L=0,R=n-1,t1=lb(),t1=a[t1];else t1=b[t1];t+=t1;}else t+=t;printf("%.2f\n",t/2.);}return 0;
}