#include <cstdio>
#include <iostream>

using namespace std;

const int N = 500005;

typedef long long LL;

int n;

int head[N], numE = 0, f[N], st[N], top, fa[N];

LL cnt[N];

char s[N];

struct E{
	int next, v;
} e[N];

void inline add(int u, int v) {
	e[++numE] = (E) { head[u], v };
	head[u] = numE;
}

void dfs(int u) {
	int tmp = 0;
	if (s[u] == '(') st[++top] = u;
	else if (top) cnt[u] += (f[u] = f[fa[tmp = st[top--]]] + 1);
	for (int i = head[u]; i; i = e[i].next) {
		int v = e[i].v;
		cnt[v] += cnt[u];
		dfs(v);
	}
	if (s[u] == '(') --top;
	else if (tmp) st[++top] = tmp;
}

int main() {
	scanf("%d%s", &n, s + 1);
	for (int i = 2; i <= n; i++)
		scanf("%d", fa + i), add(fa[i], i);
	dfs(1);
	LL ans = 0;
	for (int i = 1; i <= n; i++)
		ans ^= (LL)i * cnt[i];
	printf("%lld\n", ans);
	return 0;
}