#include <bits/stdc++.h>

const int MAXN = 500000;

int n, fa[MAXN + 5];

long long f[MAXN + 5], ans;

std::string st;

std::stack<int> stack;

std::vector<int> sons[MAXN + 5];

void dfs(int u) {
    int oldSize = stack.size(), oldTop = 0;
    if (oldSize) {
        oldTop = stack.top();
    }
    if (st[u] == '(') {
        f[u] = f[fa[u]];
        stack.push(u);
    } else {
        if (stack.empty()) {
            f[u] = f[fa[u]];
        } else {
            f[u] = f[fa[u]] + 1;
            stack.pop();
        }
    }
    for (int v: sons[u]) {
        dfs(v);
    }
    while (oldSize < stack.size()) {
        stack.pop();
    }
    if (oldSize > stack.size()) {
        stack.push(oldTop);
    }
}

int main() {
    scanf("%d", &n);
    st.resize(n + 1);
    scanf("%s", &st[1]);
    for (int i = 2; i <= n; i++) {
        scanf("%d", &fa[i]);
        sons[fa[i]].push_back(i);
    }
    dfs(1);
    for (int i = 1; i <= n; i++) {
        ans ^= f[i] * i;
    }
    printf("%lld", ans);
    return 0;
}