#include <bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<(int)(n);++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)
#define tpl(...) make_tuple(__VA_ARGS__)
const int INF = 0x3f3f3f3f;
const double EPS = 1e-8;
const double PI = acos(-1);
typedef long long ll;
typedef pair<int,int> pii;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<class T>ostream&operator<<(ostream &o,const vector<T>&t){o<<'[';FOR(i,t){if(i!=t.begin())o<<',';o<<*i;}return o<<']';}
template<class S,class T>ostream&operator<<(ostream &o,const pair<S,T>&t){return o<<'('<<t.first<<','<<t.second<<')';}
template<int N,class Tp>void output(ostream&,const Tp&){}
template<int N,class Tp,class,class ...Ts>void output(ostream &o,const Tp&t){if(N)o<<',';o<<get<N>(t);output<N+1,Tp,Ts...>(o,t);}
template<class ...Ts>ostream&operator<<(ostream&o,const tuple<Ts...>&t){o<<'(';output<0,tuple<Ts...>,Ts...>(o,t);return o<<')';}
template<class T>void output(T t,char z=10){if(t<0)t=-t,putchar(45);int c[20];
int k=0;while(t)c[k++]=t%10,t/=10;for(k||(c[k++]=0);k;)putchar(c[--k]^48);putchar(z);}
template<class T>void outputs(T t){output(t);}
template<class S,class ...T>void outputs(S a,T...t){output(a,32);outputs(t...);}
template<class T>void output(T *a,int n){REP(i,n)output(a[i],i!=n-1?',':10);}
template<class T>void output(T *a,int n,int m){REP(i,n)output(a[i],m);}
template<class T>bool input(T &t){int n=1,c;for(t=0;!isdigit(c=getchar())&&~c&&c-45;);
if(!~c)return 0;for(c-45&&(n=0,t=c^48);isdigit(c=getchar());)t=10*t+c-48;t=n?-t:t;return 1;}
template<class S,class ...T>bool input(S&a,T&...t){input(a);return input(t...);}
template<class T>bool inputs(T *a, int n) { REP(i,n) if(!input(a[i])) return 0; return 1;}


template<int H, int W>
struct BinMat {
  typedef bitset<W> Vec;
  Vec v[H];
  int h,w;
  Vec& operator[](int i) { return v[i]; }
  const Vec& operator[](int i) const { return v[i]; }
  BinMat() : h(),w() {}
  BinMat(int h, int w) : h(h), w(w) { REP(i,h)v[i]=0; }
  bool gaussElimination(const Vec &b) const {
    BinMat B(h,w+1);
    REP(i,h) {
      B[i] = v[i];
      B[i][w] = b[i];
    }
    int cy = 0;
    REP(x,w) {
      int j;for (j=cy; j<h&&!B[j][x]; ++j);
      if (j == h) continue;
      swap(B[cy],B[j]);
      for (int y=cy+1; y<h; ++y)
        if (B[y][x])
          B[y] ^= B[cy];
      cy++;
    }
    for (int y=cy; y<h; ++y) if (B[y][w]) return 0;
    return 1;
  }
};

typedef BinMat<110,110> Mat;

int main() {
  int n;
  while(cin >> n) {
    Mat A(n,n);
    vector<int> d(n);
    Mat::Vec w;
    REP(i,n) input(d[i]);
    REP(i,n) {
      int a; input(a);
      w[i] = !a;
    }
    REP(i,n) {
      A[(i+d[i])%n][i] = 1;
      A[((i-d[i])%n+n)%n][i] = 1;
    }
    if (A.gaussElimination(w)) puts("Yes");
    else puts("No");
  }
}