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

struct UnionFindTree {
    vector<int> par;
    vector<int> rank;

    UnionFindTree() { }

    UnionFindTree(int n) {
        par = vector<int>(n);
        rank = vector<int>(n);

        for (int i = 0; i < n; i++) {
            par[i] = i;
            rank[i] = 0;
        }
    }

    int find(int x) {
        if (par[x] == x) {
            return x;
        } else {
            return par[x] = find(par[x]);
        }
    }

    void unite(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) return;

        if (rank[x] < rank[y]) {
            par[x] = y;
        } else {
            par[y] = x;
            if (rank[x] == rank[y]) rank[x]++;
        }
    }

    bool same(int x, int y) {
        return find(x) == find(y);
    }
};

int main() {
    int n;
    cin >> n;

    UnionFindTree uf(n);
    vector<int> d(n), w(n);
    vector<bool> have_self_circuit(n, false);

    for (int i = 0; i < n; i++) {
        cin >> d[i];
        d[i] = d[i] % n;
    }

    for (int i = 0; i < n; i++) {
        cin >> w[i];
    }

    for (int i = 0; i < n; i++) {
        int cw = (i + d[i]) % n, acw = (i + n - d[i]) % n;
        uf.unite(cw, acw);
        have_self_circuit[i] = (i == cw) || (i == acw);
    }

    for (int group = 0; group < n; group++) {
        int flipped_cnt = 0;
        bool ok = false;
        for (int coin_i = 0; coin_i < n; coin_i++) {
            if (uf.same(group, coin_i)) {
                ok = ok || have_self_circuit[coin_i];
                flipped_cnt += (w[coin_i] + 1) % 2;
            }
        }
        if (flipped_cnt % 2 == 1 && !ok) {
            cout << "No" << endl;
            return 0;
        }
    }

    cout << "Yes" << endl;

    return 0;
}