#include <bits/stdc++.h>
using namespace std;
long long a[1000010], b[1000010];
int pre[1000010], nxt[1000010];
signed main() {
	long long n, i, ans;
	scanf("%lld", &n);
	for (i = 1; i <= n; i++) {
		scanf("%lld", a + i);
		pre[i] = i - 1, nxt[i] = i + 1;
	}
	ans = (a[1] * a[2]);
	for (i = 2; i < n; i++)
		ans ^= (a[i] * a[i + 1]);
	pre[1] = -1, nxt[n] = -1;
	for (i = 1; i < n - 1; i++)
		scanf("%lld", b + i);
	printf("%lld\n", ans);
	for (i = 1; i < n - 1; i++) {
		if (pre[b[i]] != -1)
			ans ^= (a[pre[b[i]]] * a[b[i]]);
		if (nxt[b[i]] != -1)
			ans ^= (a[nxt[b[i]]] * a[b[i]]);
		if (pre[b[i]] != -1 && nxt[b[i]] != -1)
			ans ^= (a[pre[b[i]]] * a[nxt[b[i]]]);
		pre[nxt[b[i]]] = pre[b[i]];
		nxt[pre[b[i]]] = nxt[b[i]];
		pre[b[i]] = nxt[b[i]] = -1;
		printf("%lld\n", ans);
	}
	return 0;
}