#include<bits/stdc++.h>
using namespace std;
using ll = long long;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

struct UnionFind{
    vector<ll> parent;
    UnionFind(ll sz){
        parent.resize(sz);
        reset();
    }

    void reset(){
        FOR(i, 0, parent.size()){
            parent[i] = i;
        }
    }

    void unite(ll a, ll b){
        if(a>b){
            swap(a, b);
        }
        ll rootA = findRoot(a);
        ll rootB = findRoot(b);
        if(rootA>rootB){
            swap(rootA, rootB);
        }
        if(rootA==rootB){
            return;
        }else{
            // 小さい方を親にする
            parent[rootB] = rootA;
        }
    }

    ll findRoot(ll a){
        if(parent[a]==a){
            return a;
        }else{
            return parent[a] = findRoot(parent[a]);
        }
    }

    map<ll, vector<ll> > getGroups(){
        map<ll, vector<ll> > G;
        FOR(i, 0, parent.size()){
            ll r = findRoot(i);
            G[r].push_back(i);
        }
        return G;
    }
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N;
    cin >> N;

    vector<ll> D(N);
    FOR(i, 0, N){
        cin >> D.at(i);
    }

    vector<ll> W(N);
    FOR(i, 0, N){
        cin >> W.at(i);
    }

    auto uf = UnionFind(N);

    // 1枚だけひっくり返せるか
    vector<bool> F(N);
    FOR(i, 0, N){
        ll v = D[i];
        // 時計回り
        ll a = (i+v)%N;
        // 反時計回り
        ll b = (i-v)%N;
        if(b<0) b+= N;

        if(a==b){
            F[a] = true;
        }else{
            uf.unite(a, b);
        }
    }

    // グループごとに見ていく
    auto groups = uf.getGroups();
    for(auto p : groups){
        vector<ll> group = p.second;
        // vprint(group);
        if(group.size()==1){
            ll i = group[0];
            if(W[i]==0){
                if(!F[i]){
                    p_no();
                    return 0;
                }
            }
        }
        else{
            // 1枚フリップできるものがあるか
            bool flippable = false;
            for(ll i : group){
                if(F[i]) flippable = true;
            }

            ll back_num = 0;
            for(ll i : group){
                if(W[i]==0) back_num++;
            }

            if(!flippable){
                // 裏のものが偶数じゃないとアウト
                if(back_num%2==1){
                    p_no();
                    return 0;
                }   
            }
        }
    }
    p_yes();

    return 0;
}