#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

class UnionFind {
    int n;
    vector<int> uni;
public:
    explicit UnionFind(int n) : uni(static_cast<u32>(n), -1) , n(n){};

    int root(int a){
        if (uni[a] < 0) return a;
        else return (uni[a] = root(uni[a]));
    }

    bool unite(int a, int b) {
        a = root(a);
        b = root(b);
        if(a == b) return false;
        if(uni[a] > uni[b]) swap(a, b);
        uni[a] += uni[b];
        uni[b] = a;
        return true;
    }
    
    int size(int i){ return -uni[root(i)]; }
    bool same(int a, int b) { return root(a) == root(b); }
};

int main() {
    int n;
    cin >> n;
    vector<int> d(n), w(n);
    for (auto &&i : d) scanf("%d", &i);
    for (auto &&j : w) scanf("%d", &j);
    vector<int> ok(n), cnt(n);
    UnionFind uf(n);
    for (int i = 0; i < n; ++i) {
        int l = (i+(n-1)*d[i])%n, r = (i+d[i])%n;
        if(l == r) ok[l] = 1;
        uf.unite(l, r);
    }
    for (int i = 0; i < n; ++i) {
        cnt[uf.root(i)] += 1-w[i];
        ok[uf.root(i)] += ok[i];
    }
    for (int i = 0; i < n; ++i) {
        if(uf.root(i) == i){
            if(!ok[i] && cnt[i] & 1){
                puts("No");
                return 0;
            }
        }
    }
    puts("Yes");
    return 0;
}