#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int maxn = 5e5 + 5;
int lst[maxn], fa[maxn], head[maxn], n, tot;
ll dp[maxn], sum[maxn];
int ch[maxn];
struct edge {
	int u, v, nxt;
} e[maxn << 1];

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

ll ans;
void dfs(int u) {
	ans ^= sum[u] * u;
	//printf("%d %d\n", u, dp[u]);
	for (int i = head[u]; i; i = e[i].nxt) {
		int v = e[i].v;
		if (ch[v] == ')') {
			if (ch[u] == '(') {
				lst[v] = u;
				dp[v] += (dp[fa[u]] + 1);
			}
			else {
				if (ch[fa[lst[u]]] == '(') {
					lst[v] = fa[lst[u]];
					dp[v] += (dp[fa[lst[v]]] + 1);
				}
			}
		}
		sum[v] = dp[v] + sum[u];
		dfs(v);
	}
}

void read() {
	scanf("%d", &n);
	for (int i = 1; i <= n; ++ i) {
		scanf(" %c", &ch[i]);
	}
	for (int i = 2, u; i <= n; ++ i) {
		scanf("%d", &u);
		fa[i] = u;
		add(u, i);
	}
	dfs(1);
	printf("%lld\n", ans);
}

int main() {
	read();
	return 0;
}

$[/(ㄒoㄒ)/~~]$