#include "bits/stdc++.h"
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define REP(i, n) for(int i = 0; i < (int)(n); i++)
#define REPR(i, n) for(int i = (int)(n); i >= 0; i--)
#define FOR(i,n,m) for(int i = (int)(n); i < int(m); i++)
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = MOD - 1;
const ll LLINF = 4e18;

//UnionFind
class UnionFind {
private:
    vector<int> par;
public:
    UnionFind(int n) {
        par.resize(n, -1);
    }

    int root(int x) {
        if (par[x] < 0) return x;
        return par[x] = root(par[x]);
    }

    bool unite(int x, int y) {
        int rx = root(x);
        int ry = root(y);
        if (rx == ry) return false;
        if (size(rx) < size(ry)) swap(rx, ry);
        par[rx] += par[ry];
        par[ry] = rx;
        return true;
    }

    bool same(int x, int y) {
        int rx = root(x);
        int ry = root(y);
        return rx == ry;
    }

    int size(int x) {
        return -par[root(x)];
    }
};

int main() {
    int n; cin >> n;
    UnionFind uni(n);
    vector<int> d(n),w(n);
    vector<int> b;
    REP(i, n) {
        cin >> d[i];
        d[i] -= d[i] / n * n;
    }
    REP(i, n) cin >> w[i];
    REP(i, n) {
        int a = (i + d[i]) % (n - 1);
        int c = (n - 1 + i - d[i]) % (n - 1);
        if (a == c) {
            b.push_back(a);
        }
        else {
            uni.unite(a, c);
        }
    }
    map<int, int> mp;
    REP(i, n) {
        mp[uni.root(i)] = 0;
    }
    for (auto e : b) {
        mp[uni.root(e)] = -1;
    }
    REP(i, n) {
        if (w[i] == 0 && mp[uni.root(i)] != -1) {
            mp[uni.root(i)]++;
        }
    }
    for (auto e : mp) {
        if (e.second != -1 && e.second % 2 == 1) {
            puts("No");
            return 0;
        }
    }
    puts("Yes");
    getchar(); getchar();
}