#include<bits/stdc++.h>
#define rep(x,y,z) for(int x=y;x<=z;x++)
#define drep(x,y,z) for(int x=y;x>=z;x--)
#define ull unsigned long long
#define ll long long
using namespace std;
inline int read()
{
	int x=0;bool flag=1;char ch=getchar();
	while(ch<'0'||ch>'9') {if(ch=='-')flag=0;ch=getchar();}
	while(ch>='0'&&ch<='9') {x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
	if(flag) return x;
	return ~(x-1);
}
inline void write(int x)
{
	if(x<0) {x=~(x-1);putchar('-');}
	if(x>9) write(x/10);
	putchar(x%10+'0');
}
///////////////////////////////
int nc;
ll ans;
struct tre
{
	char me;
	int f;
	int ch;
	int br;
	ll rms;
	ll su;
	int lc;
}a[500001];
inline void dfs(ll x)
{
	a[x].su=a[a[x].f].su;
	if(a[x].me=='(')
	{
		a[x].lc=a[a[x].f].lc;
	    if(a[a[x].f].me=='(') a[x].lc=a[x].f; 
	    else a[x].rms=a[a[x].f].rms;
	}
	else if(a[a[x].f].me=='(') 
	{
		a[x].rms+=(1+a[a[x].f].rms);
		a[x].su+=a[x].rms;
		a[x].lc=a[a[x].f].lc;
	}
	else if(a[a[x].f].lc!=0)
	{
		a[x].rms=a[a[a[x].f].lc].rms+1;
		a[x].su+=a[x].rms;
		a[x].lc=a[a[a[x].f].lc].lc;
	}
	ans^=(x*a[x].su);
	if(a[x].ch!=0) dfs(a[x].ch);
	if(a[x].br!=0) dfs(a[x].br);
	return;
}
int main()
{
    freopen("2019brackets.in","r",stdin);
    freopen("2019brackets.out","w",stdout);
    nc=read();
    rep(i,1,nc) cin>>a[i].me;
    int s1;
    rep(i,2,nc)
    {
    	s1=read();
    	a[i].f=s1;
    	if(a[s1].ch==0) a[s1].ch=i;
    	else a[i].br=a[s1].ch,a[s1].ch=i;
    }
    dfs(1);
    cout<<ans<<endl; 
	return 0;
}