#include <bits/stdc++.h>
using namespace std;
int n;
const int maxn=525015;
int A[maxn],par[maxn];
vector<int>child[maxn];
const int LG = 22;
const int SLG=11;
int pre[LG][maxn];
int B[LG][1<<SLG+5];
int out;
int sum[LG];
typedef pair<int,int>pi;
vector<pi>update[maxn];
int32_t main(){
	cin >> n;
	for(int i=1;i<=n;i++)cin>>A[i];
	for(int i=2;i<=n;i++){
		cin>>par[i];
		child[par[i]].push_back(i);
	}
	for(int i=n;i>=1;i--){
		for(int bit = SLG; bit<LG;bit++){ // just jump
			int curt = A[i] % (1<<(bit+1));
			if(curt>=1<<bit){
				pre[bit][i]++;
			} else{
				pre[bit][i - ((1<<bit)-curt)]++;
			}
			
			int idx=i-((1<<(bit+1)) - curt);
			if(idx >= 1)pre[bit][idx]--;
			
			while(idx >= 1){
				if(idx-(1<<bit) >= 1)pre[bit][idx-(1<<bit)]++;
				if(idx - (1<<(bit+1)) >= 1)pre[bit][idx-(1<<(bit+1))]--;
				idx-=1<<(bit+1);
			}
		}	
		for(int bit=0;bit<SLG;bit++){
			int T = (1<<(bit+1));
			int curt = A[i] % T;
			if(curt>=1<<bit){
				pre[bit][i]++;
			} else{
				if(i - ((1<<bit)-curt) >= 1)pre[bit][i - ((1<<bit)-curt)]++;
			}
	
			int ti = 0;
			int idx=i-((1<<(bit+1)) - curt);
		
			if(idx>=1)update[idx].push_back({bit,idx%T});
			
		}
		for(auto x:update[i]){
			B[x.first][x.second]++;
		}
		for(int bit=0;bit<LG;bit++){
			pre[bit][i]+=pre[bit][i+1];
		}
		int ans=0;
		for(int bit = 0; bit<LG;bit++){
			int T = (1<<(bit+1));
			
			if(bit<SLG){
				int diff=0;
				
				diff -= B[bit][i%T];
				
				if(i%T >= T/2)diff += B[bit][i%T - T/2];
				else diff += B[bit][i%T + T/2];
			
				pre[bit][i] += diff;
			} else{
				
			}
			

		}
		for(int bit=0;bit<LG;bit++){
			int on = pre[bit][i] % 2;
		
			if(on){
				ans += 1<<bit;
			}
		}
		out +=ans;
		//cerr<<i<<":"<<ans<<endl;
	}
	cout<<out;
		
}