#include <iostream>
#include <cstdio>
#include <vector>
#include <stack>

using namespace std;
typedef long long i64;

int n, fa[500005];
i64 ans = 0, f[500005], g[500005];
char s[500005];
vector <int> son[500005];
stack <int> v;

void dp(int x)
{
    int tmp = -1;
    if (s[x] == ')')
    {
        if (!v.empty())
        {
            tmp = v.top();
            g[x] = g[fa[tmp]] + 1;
            v.pop();
        }
    }
    else v.push(x);
    f[x] = f[fa[x]] + g[x];
    for (int i = 0; i < son[x].size(); ++i)
        dp(son[x][i]);
    if (tmp != -1) v.push(tmp);
    else if (!v.empty()) v.pop();
}

int main(void)
{
    scanf("%d%s", &n, s + 1);
    for (int i = 2, x; i <= n; ++i)
        scanf("%d", &x), son[x].push_back(i), fa[i] = x;
    dp(1);
    for (int i = 1; i <= n; ++i)
        ans ^= f[i] * i;
    printf("%lld\n", ans);
    return 0;
}