#include <iostream>
#include <vector>
#include <set>
#include <functional>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
using namespace std;
int main() {
    // input
    int n; cin >> n;
    vector<int> d(n); repeat (i,n) cin >> d[i];
    vector<bool> w(n); repeat (i,n) { int it; cin >> it; w[i] = it; }
    // make graph
    vector<set<int> > g(n);
    repeat (i,n) {
        int x =  (i + d[i]) % n;
        int y = ((i - d[i]) % n + n) % n;
        g[x].insert(y);
        g[y].insert(x);
    }
    vector<bool> loop(n);
    repeat (i,n) loop[i] = g[i].count(i);
    while (true) {
        bool modified = false;
        repeat (i,n) if (not loop[i]) {
            for (int j : g[i]) if (loop[j]) {
                loop[i] = true;
                modified = true;
            }
        }
        if (not modified) break;
    }
    // check the answer
    function<void (int, set<int> &)> select = [&](int i, set<int> & component) {
        component.insert(i);
        for (int j : g[i]) if (not component.count(j)) {
            select(j, component);
        }
    };
    bool ans = true;
    vector<bool> used(n);
    repeat (i,n) if (not used[i]) {
        if (loop[i]) {
            used[i] = true;
            continue;
        }
        set<int> component;
        select(i, component);
        int cnt = 0;
        for (int j : component) {
            used[j] = true;
            cnt += not w[j];
        }
        if (cnt % 2 != 0) {
            ans = false;
            break;
        }
    }
    // output
    cout << (ans ? "Yes" : "No") << endl;
    return 0;
}