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

typedef vector<int> vec;
typedef vector<vec> mat;

bool check(mat A, vec b){
    const int M = (int)A.size();
    const int N = (int)A[0].size();
    
    vector<bool> used(M, false);
    for(int j=0;j<N;j++){
        int p = -1;
        for(int i=0;i<M;i++)if(!used[i] && A[i][j] == 1){
            p = i;
            break;
        }
        if(p == -1)continue;
        
        used[p] = true;
        for(int k=0;k<M;k++)if(!used[k]){
            int c = A[k][j];
            
            for(int l=0;l<N;l++){
                A[k][l] = (A[k][l] - A[p][l] * c + 2) % 2;
            }
            
            b[k] = (b[k] - b[p] * c + 2) % 2;
        }
    }
    
    for(int i=0;i<M;i++){
        if(!used[i] && b[i] != 0){
            return false;
        }
    }
    
    return true;
}

string solve(int N, vector<int> D, vector<int> W){
    mat A(N, vec(N, 0));
    for(int i=0;i<N;i++){
        int L = (i - D[i] % N + N) % N;
        int R = (i + D[i]) % N;
        
        A[L][i] = 1;
        A[R][i] = 1;
    }
    vec b(N);
    for(int i=0;i<N;i++)b[i] = 1 - W[i];
    
    return check(A, b) ? "Yes" : "No";
}

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;
}