#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int main() {
	int N; cin >> N;
	vector<int> D(N), W(N);
	for (int i = 0; i < N; i++) cin >> D[i];
	for (int i = 0; i < N; i++) cin >> W[i];
	for (int t = 0; t < 1000000; t++) {
		int sum = 0;
		for (int i = 0; i < N; i++) sum += W[i];
		if (sum == N) {
			cout << "Yes" << endl;
			return 0;
		}
		for (int _t = 0; _t < 100; _t++) {
			int i = rand() % N;
			int next = (i + D[i]) % N, prev = ((i - D[i]) % N + N) % N;
			if (W[next] && W[prev]) continue;
			W[next] = !W[next];
			if (next != prev) W[prev] = !W[prev];
			break;
		}
	}
	cout << "No" << endl;
}