#include <bits/stdc++.h>
using namespace std;
#define repd(i,a,b) for (ll i=(a);i<(b);i++)
#define rep(i,n) repd(i,0,n)
#define all(x) (x).begin(),(x).end()
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
typedef long long ll;
typedef pair<ll,ll> P;
typedef vector<ll> vec;
using Graph = vector<vector<ll>>;
const long long INF = 1LL<<60;
const long long MOD = 1000000007;

int main()
{  
    ios::sync_with_stdio(false);
    cin.tie(0);
    ll n;cin>>n;
    vec d(n),w(n);
    rep(i,n)cin>>d[i];
    rep(i,n){
      cin>>w[i];
      w[i]=1-w[i];
    }
    Graph g(n,vec(n));
    rep(i,n){
      ll x=i+d[i];
      ll y=i-d[i];
      x%=n;
      y%=n;
      if(y<0)y+=n;
      g[x][i]=1;
      if(x!=y)g[y][i]=1;
    }
    ll cnt=0;
    rep(i,n){
      ll idx=-1;
      repd(j,cnt,n){
        if(g[j][i]){
          idx=j;
          break;
        }
      }
      if(idx==-1)continue;
      swap(g[cnt],g[idx]);
      swap(w[idx],w[cnt]);
      repd(j,cnt+1,n){
        if(g[j][i]){
          rep(k,n){
            g[j][k]^=g[cnt][k];
          }
          w[j]^=w[cnt];
        }
      }
      cnt++;
    }
    repd(i,cnt,n){
      if(w[i]==1){
        cout<<"No"<<endl;
        return 0;
      }
    }
    cout<<"Yes"<<endl;
    return 0;
}