#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

int con[101][101];

int main(){
    int N;
    cin >> N;
    vi D(N), W(N);
    rep(i, N)cin >> D[i];
    rep(i, N)cin >> W[i];
    vi self;
    rep(i, N){
        int a = (i + D[i]) % N, b = ((i - D[i]) % N + N) % N;
        if(a == b)self.push_back(a);
        else{
            con[a][b] = con[b][a] = 1;
        }
    }
    rep(k, N)rep(u, N)rep(v, N)con[u][v] |= con[u][k] & con[k][v];
    rep(i, N)if(!W[i]){
        each(se, self){
            if(con[i][se]){
                W[i] = 1;
                break;
            }
        }
    }
    rep(i, N)rep(j, i)if(!W[i] && !W[j]){
        if(con[i][j])W[i] = W[j] = 1;
    }
    
    bool ans = count(all(W), 1)==N;
    puts(ans ? "Yes" : "No");
}