#include <cstdio>
using namespace std;
const int N = 5e5;
int n,a[N + 5],f_[3 * N + 5],*f = f_ + N,rot;
int to[N + 5],pre[N + 5],first[N + 5];
inline void add(int u,int v)
{
	static int tot = 0;
	to[++tot] = v,pre[tot] = first[u],first[u] = tot;
}
long long cur,ans;
int temp[N + 5];
void dfs(int p)
{
	rot += a[p];
	(a[p] == 1) && (temp[p] = f[-rot],f[-rot] = 0,++f[a[p] - rot]);
	ans ^= p * (cur += f[-rot]);
	for(register int i = first[p];i;i = pre[i])
		dfs(to[i]);
	cur -= f[-rot];
	(a[p] == 1) && (--f[a[p] - rot],f[-rot] = temp[p]);
	rot -= a[p];
}
int main()
{
	//freopen("brackets.in","r",stdin);
	//freopen("brackets.out","w",stdout);
	scanf("%d",&n);
	char ch;
	for(register int i = 1;i <= n;++i)
		scanf(" %c",&ch),a[i] = ch == '(' ? 1 : -1;
	int u;
	for(register int i = 2;i <= n;++i)
		scanf("%d",&u),add(u,i);
	dfs(1);
	printf("%lld\n",ans);
	fclose(stdin);
	fclose(stdout);
	return 0;
}