#include <bits/stdc++.h>
using namespace std;
#define int long long
struct node{
    int val,next=-1,last=-1;
}s[1000005];
int n,b,ans;
signed main(){
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        scanf("%lld",&s[i].val);
        if(i!=n)s[i].next=i+1;
        if(i!=1)s[i].last=i-1;
        if(i!=1)ans^=s[i].val*s[i-1].val;
    }
    printf("%lld\n",ans);
    for(int i=1;i<=n-2;i++){
        scanf("%d",&b);
        if(s[b].last==-1){
            s[s[b].next].last=-1;
            ans^=s[b].val*s[s[b].next].val;
        }
        else if(s[b].next==-1){
            s[s[b].last].next=-1;
            ans^=s[b].val*s[s[b].last].val;
        }
        else{
            ans^=s[b].val*s[s[b].last].val;
            ans^=s[b].val*s[s[b].next].val;
            ans^=s[s[b].last].val*s[s[b].next].val;
            s[s[b].last].next=s[b].next;
            s[s[b].next].last=s[b].last;
        }
        printf("%lld\n",ans);
    }
    return 0;
}