#include<stdio.h>
#include<string.h>
const int MX=10010;
char g1[100010],g2[100010];
int in[MX],ps[MX],l[MX],r[MX],b,bs;
int bld(int l1,int r1,int l2,int r2){
if(l1>r1)return 0;
int rt=ps[r2],p=l1;
while(in[p]!=rt)p++;
int c=p-l1;
l[rt]=bld(l1,p-1,l2,l2+c-1);
r[rt]=bld(p+1,r1,l2+c,r2-1);
return rt;
}void dfs(int q,int s){
s+=q;
if(!l[q]&&!r[q]&&(s<bs||(s==bs&&q<b)))
{b=q;bs=s;}
if(l[q])dfs(l[q],s);
if(r[q])dfs(r[q],s);
}int main(){
int i,m,n;
while(gets(g1)&&gets(g2)){
memset(in,0,sizeof(in));
memset(ps,0,sizeof(ps));
m=strlen(g1);n=1;
for(i=0;i<m;i++)
if(g1[i]!=' ')
in[n]=in[n]*10+g1[i]-'0';
else n++;
m=strlen(g2);n=1;
for(i=0;i<m;i++)
if(g2[i]!=' ')
ps[n]=ps[n]*10+g2[i]-'0';
else n++;
bs=1000000000;
bld(1,n,1,n);
dfs(ps[n],1);
printf("%d\n",b);
}return 0;
}
#include<string.h>
const int MX=10010;
char g1[100010],g2[100010];
int in[MX],ps[MX],l[MX],r[MX],b,bs;
int bld(int l1,int r1,int l2,int r2){
if(l1>r1)return 0;
int rt=ps[r2],p=l1;
while(in[p]!=rt)p++;
int c=p-l1;
l[rt]=bld(l1,p-1,l2,l2+c-1);
r[rt]=bld(p+1,r1,l2+c,r2-1);
return rt;
}void dfs(int q,int s){
s+=q;
if(!l[q]&&!r[q]&&(s<bs||(s==bs&&q<b)))
{b=q;bs=s;}
if(l[q])dfs(l[q],s);
if(r[q])dfs(r[q],s);
}int main(){
int i,m,n;
while(gets(g1)&&gets(g2)){
memset(in,0,sizeof(in));
memset(ps,0,sizeof(ps));
m=strlen(g1);n=1;
for(i=0;i<m;i++)
if(g1[i]!=' ')
in[n]=in[n]*10+g1[i]-'0';
else n++;
m=strlen(g2);n=1;
for(i=0;i<m;i++)
if(g2[i]!=' ')
ps[n]=ps[n]*10+g2[i]-'0';
else n++;
bs=1000000000;
bld(1,n,1,n);
dfs(ps[n],1);
printf("%d\n",b);
}return 0;
}