#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double pi = acos(-1);
const double eps = 1e-10;
int n;
vi m[100];
bool an[100], y[100], w[100];

main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin >> n;
  FOR(i, 0, n){
    int d, a, b;
    cin >> d;
    a = (i-d)%n;
    if(a<0) a+=n;
    b = (i+d)%n;
    if(a==b){
      an[a] = true;
    }else{
      m[a].pb(b);
      m[b].pb(a);
    }
  }
  FOR(i, 0, n){
    int d;
    cin >> d;
    w[i] = (d == 0);
  }
  queue<int> q;
  FOR(i, 0, n){
    if(y[i]) continue;
    y[i] = true;
    bool any = false;
    int cnt = 0;
    q.push(i);
    while(!q.empty()){
      int t = q.front();
      q.pop();
      if(w[t])cnt++;
      any = any || an[t];
      each(itr, m[t]){
        if(!y[*itr]){
          y[*itr] = true;
          q.push(*itr);
        }
      }
    }
    if(!(any||cnt%2==0)){
      cout << "No\n";
      return 0;
    }
  }
  cout << "Yes\n";
  return 0;
}