#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
typedef long long ll;
int n, x, pre[N], nxt[N];
ll a[N], ans;
void handle(int pos)
{
	if (pos == 1)
		ans ^= a[1] * a[nxt[1]];
	else if (pos == n)
		ans ^= a[n] * a[pre[n]];
	else
	{
		ans ^= a[pos] * a[pre[pos]];
		ans ^= a[pos] * a[nxt[pos]];
		ans ^= a[pre[pos]] * a[nxt[pos]];
	}
	pre[nxt[pos]] = pre[pos], nxt[pre[pos]] = nxt[pos];
}
int main()
{
#ifndef ONLINE_JUDGE
	freopen("data.in", "r", stdin);
	// freopen("data.out", "w", stdout);
#endif
	scanf("%d", &n);
	for (int i = 1; i <= n; i++)
	{
		scanf("%lld", &a[i]);
		pre[i] = i - 1, nxt[i] = i + 1;
		ans ^= a[i] * a[i - 1];
	}
	for (int i = 1; i <= n - 1; i++)
	{
		if (i != 1)
			scanf("%d", &x), handle(x);
		printf("%lld\n", ans);
	}
	return 0;
}