#include<cstdio>
#define N 1000005
using namespace std;
int n,m,p[N],f[N],h[N],cnt,d[N],ans[N],x;bool b[N]={1};
struct edge{int v,n;}e[N];
void ad(int u,int v){e[++cnt]={v,h[u]};h[u]=cnt;}
void dfs(int u)
{
	for(int i=h[u];i;i=e[i].n)d[e[i].v]=d[u]+1,dfs(e[i].v);
}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
int main(){
	freopen("Vocabulary.in","r",stdin);freopen("Vocabulary.out","w",stdout);
	n=read();for(int i=1;i<=n;i++)ad(f[i]=read(),i);
	for(int i=1;i<=n;i++)if(!h[i])m++;
	for(int i=1;i<=m;i++)p[i]=read();
	dfs(0);
	for(int i=m;i;i--)
	{
		x=p[i];
		while(!b[x])
		{
			x=f[x];
			for(int i=h[x];i;i=e[i].n)b[e[i].v]=1;
		}
		ans[i]=d[x];
	}
	for(int i=1;i<=m;i++)printf("%d\n",ans[i]);
	return 0;
}