#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>

using namespace std;
 
struct UnionFind {
    vector<long long> par;
    vector<long long> siz;

    UnionFind(long long N) : par(N), siz(N) {
        for(long long i = 0; i < N; i++){
            par[i] = i;
            siz[i] = 1;
        }   
    }   
 
    long long root(long long x) {
        if (par[x] == x) return x;
        return par[x] = root(par[x]);
    }   
 
    long long unite(long long x, long long y) {
        long long rx = root(x);
        long long ry = root(y);
        if (rx == ry) return rx; 
        if (siz[rx] > siz[ry]) swap(rx, ry);
        par[rx] = ry; 
        siz[ry] += siz[rx];
        return ry; 
    }   
 
    bool same(long long x, long long y) {
        long long rx = root(x);
        long long ry = root(y);
        return rx == ry; 
    }   
 
    long long size(long long x){ 
        return siz[root(x)];
    }   
};

int main(){
 
    int N, x, y;
    cin >> N;
    vector<int> D(N), cnt(N), W(N), ok(N);
    UnionFind tree(N);
    set<int> st;
    for (int i=0; i<N; i++) cin >> D[i];
    for (int i=0; i<N; i++) cin >> W[i];
    for (int i=0; i<N; i++){
        x = (i+D[i]) % N;
        y = ((i-D[i]) % N + N) % N;
        if (x == y) st.insert(x);
        else tree.unite(x, y);
    }
    for (int i=0; i<N; i++){
        if (W[i] == 0) cnt[tree.root(i)]++;
    }

    for (auto z : st) ok[tree.root(z)] = 1;
    for (int i=0; i<N; i++){
        if (tree.root(i) == i && ok[i] == 0 && cnt[i] % 2 == 1){
            cout << "No" << endl;
            return 0;
        }
    }

    cout << "Yes" << endl;
 
    return 0;
}