#include <iostream>
#include <vector>
using namespace std;

int root[111];
int find(int x){
    if(root[x] == x)return x;
    return root[x] = find(root[x]);
}
void meld(int x, int y){
    x = find(x);
    y = find(y);
    root[x] = y;
}

bool spec[111];
string solve(int N, vector<int> D, vector<int> W){
    for(int i=0;i<N;i++)root[i] = i;
    for(int i=0;i<N;i++){
        int L = (i - D[i] % N + N) % N;
        int R = (i + D[i]) % N;
        
        if(L == R){
            spec[L] = true;
        } else {
            meld(L, R);
        }
    }
    
    for(int i=0;i<N;i++){
        int cnt = 0;
        bool can = false;
        for(int j=0;j<N;j++){
            if(find(j) == i){
                if(W[j] == 0)++cnt;
                if(spec[j])can = true;
            }
        }
        if(cnt % 2 == 0 || can)continue;
        return "No";
    }
    
    return "Yes";
}

int main(){
    int N;
    cin >> N;
    
    vector<int> D(N), W(N);
    for(int i=0;i<N;i++){
        cin >> D[i];
    }
    for(int i=0;i<N;i++){
        cin >> W[i];
    }
    
    cout << solve(N, D, W) << endl;
    return 0;
}