/* -*- coding: utf-8 -*-
 *
 * 74.cc: No.74 貯金箱の退屈 - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 100;

/* typedef */

typedef vector<int> vi;

/* global variables */

int n, ds[MAX_N];
bool wis[MAX_N];
vi vbs[MAX_N];

/* subroutines */

void print_v(bool v[MAX_N]) {
  for (int i = 0; i < n; i++) printf("%d", v[i]); putchar('\n');
}

void print_m(bool m[MAX_N][MAX_N]) {
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) printf("%d", m[i][j]); putchar('\n');
  }
}

bool check(int u, int v) {
  //printf("%d,%d: ", u, v); print_v(wis);
  while (v >= vbs[u].size()) {
    if (wis[u]) return false;
    u++, v = 0;
    if (u >= n) return true;
  }

  int u0 = vbs[u][v];
  wis[u] ^= true;
  if (u != u0) wis[u0] ^= true;
  if (check(u, v + 1)) return true;
  if (u != u0) wis[u0] ^= true;
  wis[u] ^= true;

  return check(u, v + 1);
}

/* main */

int main() {
  cin >> n;

  for (int i = 0; i < n; i++) cin >> ds[i];
  for (int i = 0; i < n; i++) {
    int wi;
    cin >> wi;
    if (wi == 0) wis[i] = true;
  }

  for (int i = 0; i < n; i++) {
    int i0 = (i + ds[i]) % n;
    int i1 = (i - ds[i]) % n;
    while (i1 < 0) i1 += n;

    if (i0 > i1) swap(i0, i1);
    vbs[i0].push_back(i1);
  }
  //print_v(wis);
  //for (int i = 0; i < n; i++) printf("%lu ", vbs[i].size()); putchar('\n');

  cout << (check(0, 0) ? "Yes" : "No") << endl;
  return 0;
}