#include <cstdio>
#include <queue>

int N;
std::vector<int> G[100];
bool used[100], cycle[100];
int D[100], W[100];

void addEdge(int i, int j){
    G[i].push_back(j);
    G[j].push_back(i);
}

bool can(int u){
    used[u] = true;

    std::queue<int> q;
    q.push(u);

    bool f = false;
    int n = !W[u];
    while(!q.empty()){
        int v = q.front(); q.pop();

        for(int w : G[v]){
            if(used[w]){continue;}
            if(cycle[w]){f = true;}
            if(W[w] == 0){n += 1;}
            used[w] = true;
            q.push(w);
        }
    }

    return f || n % 2 == 0;
}

int main(){
    scanf("%d", &N);

    for(int i=0;i<N;i++){
        scanf("%d", D+i);
        addEdge((i+D[i])%N, ((i-D[i])%N+N)%N);
        if((i+D[i]) % N == ((i-D[i])%N+N) % N){
            cycle[(i+D[i]) % N] = true;
        }
    }
    for(int i=0;i<N;i++){scanf("%d", W+i);}

    bool f = true;
    for(int i=0;i<N;i++){
        if(used[i]){continue;}

        f &= can(i);
    }

    if(f){puts("Yes");}
    else{puts("No");}
}