import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N;
int[] D;
int[] W;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      D = new int[N];
      foreach (i; 0 .. N) {
        D[i] = readInt();
      }
      W = new int[N];
      foreach (i; 0 .. N) {
        W[i] = readInt();
      }
      
      auto a = new int[][](N, N);
      auto b = new int[N];
      foreach (j; 0 .. N) {
        a[(j + D[j]) % N][j] = 1;
        a[((j - D[j]) % N + N) % N][j] = 1;
      }
      foreach (i; 0 .. N) {
        b[i] = 1 - W[i];
      }
      debug {
        writeln("a, b = ");
        foreach (i; 0 .. N) {
          writeln(a[i], " ", [b[i]]);
        }
      }
      
      int r;
      foreach (h; 0 .. N) {
        foreach (i; r .. N) {
          if (a[i][h]) {
            swap(a[r], a[i]);
            swap(b[r], b[i]);
            break;
          }
        }
        if (a[r][h]) {
          foreach (i; r + 1 .. N) {
            if (a[i][h]) {
              foreach (j; h .. N) {
                a[i][j] ^= a[r][j];
              }
              b[i] ^= b[r];
            }
          }
          ++r;
        }
      }
      debug {
        writeln("a, b = ");
        foreach (i; 0 .. N) {
          writeln(a[i], " ", [b[i]]);
        }
      }
      
      bool ans = true;
      foreach (i; r .. N) {
        ans &= (b[i] == 0);
      }
      writeln(ans ? "Yes" : "No");
    }
  } catch (EOFException e) {
  }
}