#include "bits/stdc++.h"
using namespace std;

#define REP(i, n) for(int i=0; i<(n); i++)

int N;
struct coin { int D, W, U; };
vector<coin> coins(1000);

void setu(int i) {
    int bi = (i + coins[i].D) % N;
    int ai = (N*2000 + i - coins[i].D) % N;
    coins[bi].U = coins[ai].U;
}

int top(int i, int start) {
    if (coins[i].U == i) return i;
    if (coins[i].U == start) return start;
    return top(coins[i].U, start);
}

bool isok(int i) {
    int backcnt = 0;
    int singlecnt = 0;
    int u = -1;
    REP(j,N) {
        coin c = coins[j];
        if (u == -1) {
            u = top(j,j);
        } else {
            if (top(j, u) != u) continue;
        }
        backcnt += (c.W == 0);
        // 一つを返せるやつかどうか
        int bi = (i + c.D) % N;
        int ai = (N + i - c.D) % N;
        if (bi == ai) singlecnt++;
    }
    return (singlecnt > 0) || (backcnt % 2 == 0);
}

signed main()
{
    cin >> N;
    REP(i,N) cin >> coins[i].D;
    REP(i,N) cin >> coins[i].W;
    REP(i,N) coins[i].U = i;
    REP(i,N) {
        // Union-Find木を構築
        setu(i);
    }
    bool ok = true;
    REP(i,N) {
        // Union-Find木毎に判定
        ok &= isok(i);
    }
    cout << (ok ? "Yes" : "No") << endl;
    return 0;
}