#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;

struct union_find {
	vector<int> v;
	union_find(int n) : v(n, -1) {}
	int find(int x) { return (v[x] < 0) ? x : (v[x] = find(v[x])); }
	void unite(int x, int y) {
		x = find(x); y = find(y);
		if (x != y) {
			if (-v[x] < -v[y]) swap(x, y);
			v[x] += v[y]; v[y] = x;
		}
	}
	bool same(int x, int y) { return find(x) == find(y); }
	int size(int x) { return -v[find(x)]; }
};

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];
	union_find uf(N);
	for (int i = 0; i < N; i++) {
		if ((i + D[i]) % N == ((i - D[i]) % N + N) % N)
			W[(i + D[i]) % N] = 2;
		uf.unite((i + D[i]) % N, ((i - D[i]) % N + N) % N);
	}
	vector<int> a(N);
	vector<bool> b(N);
	for (int i = 0; i < N; i++) {
		if (W[i] == 2) b[uf.find(i)] = true;
		if (!W[i]) a[uf.find(i)]++;
	}
	bool flag = true;
	for (int i = 0; i < N; i++)
		if (a[i] % 2 && !b[i]) flag = false;
	cout << (flag ? "Yes" : "No") << endl;
}