#include<iostream>
using namespace std;
int A[50000];
int B[50000];
int main()
{
int n;
cin>>n;
for(int i=0;i<n;++i)
{
cin>>A[i];
}
for(int i=0;i<n;++i)
{
cin>>B[i];
}
int st1=0,en1=n-1,st2=0,en2=n-1;
while(true)
{
int kk = st2;
while(A[st1]!=B[kk]) { //kk是根节点位置
++kk;
}
if(kk>st2){ //左子树非空
st1 = st1+1;
en1 = st1+kk-st2;
st2 = st2;
en2 = kk-1;
}
else if(kk<en2)//左子树空,又子树非空
{
st1 = st1+kk-st2+1;
en1=en1;
st2 = kk+1;
en2 = en2;
}
else{
cout<<A[st1]<<endl;
break;
}
}
return 0;
}