#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, Single; };
vector<coin> coins(1000);

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

void setu(int i) {
    int bi = (i + coins[i].D) % N;
    int ai = (N*2000 + i - coins[i].D) % N;
    int bg = top(bi);
    int ag = top(ai);
    if (bg == -1 && ag == -1) {
        // 未所属同士: グループ化
        coins[bi].U = coins[ai].U = max(bi, ai);
    } else {
        coins[bi].U = coins[ai].U = max(bg, ag); // -1以外でグループに入る
    }
    if (bi == ai) coins[bi].Single = coins[ai].Single = 1;
}

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);
        } else {
            if (top(j) != u) continue;
        }
        backcnt += (c.W == 0);
        // 一つを返せるやつかどうか
        singlecnt += c.Single;
        if (u == -1) break; // 未所属なのでチェック終わり
    }
    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 = -1;
        coins[i].Single = 0;
    }
    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;
}