#include<bits/stdc++.h>
using namespace std;
long long n;
long long ans;
long long a[1005000],b;
long long next_[1005000],fro[1005000];
void fun(long long b)
{
	if(b==1)
		ans^=a[1]*a[next_[1]];
	else if(b==n)
		ans^=a[n]*a[fro[n]];
	else
	{
		ans^=a[b]*a[fro[b]];
		ans^=a[b]*a[next_[b]];
		ans^=a[fro[b]]*a[next_[b]];
	}
	next_[fro[b]]=next_[b];
	fro[next_[b]]=fro[b];
	
}
int main()
{
	scanf("%lld",&n);
	for(long long i=1;i<=n;i++)
	{
		scanf("%lld",a+i);
		next_[i]=i+1;
		fro[i]=i-1;
	}
	for(long long i=2;i<=n;i++)
		ans^=a[i]*a[i-1];
	printf("%lld\n",ans);
	for(long long i=2;i<n;i++)
	{
		scanf("%d",&b);
		fun(b);
		printf("%lld\n",ans);
	}
	return 0;
}