module main;
// https://yang33-kassa.jp/yukicoder/yukicoder074/ より
import std;

// https://ei1333.github.io/library/structure/union-find/union-find.hpp より
struct UnionFind {
	int[] data;

	this(size_t sz)
	{
		data = new int[](sz);
		data[] = -1;
	}

	bool unite(int x, int y) {
		x = find(x), y = find(y);
		if (x == y) return false;
		if (data[x] > data[y]) swap(x, y);
		data[x] += data[y];
		data[y] = x;
		return true;
	}

	int find(int k) {
		if (data[k] < 0) return k;
		return data[k] = find(data[k]);
	}

	int size(int k) {
		return -data[find(k)];
	}

	bool same(int x, int y) {
		return find(x) == find(y);
	}

	int[][] groups() {
		int n = data.length.to!int;
		auto ret = new int[][](n);
		foreach (i; 0 .. n) {
			ret[find(i)] ~= i;
		}
		ret = ret.remove!(a => a.empty);
		return ret;
	}
}

void main()
{
	// 入力
	int N = readln.chomp.to!int;
	auto D = readln.split.to!(int[]);
	auto W = readln.split.to!(int[]);
	// 答えの計算と出力
	auto uf = UnionFind(N);
	auto self = new bool[](N);
	foreach (i; 0 .. N) {
		int r = (i + D[i]) % N;
		int l = (i - D[i] + N * 1000) % N;
		if (r == l) self[r] = true;
		uf.unite(r, l);
	}
	auto groupOK = new bool[](N);
	foreach (i; 0 .. N) {
		if (self[i])
			groupOK[uf.find(i)] = true;
	}
	auto groupSize = new int[](N);
	foreach (i; 0 .. N) {
		if (W[i] == 0)
			groupSize[uf.find(i)]++;
	}
	foreach (i; 0 .. N) {
		if (uf.find(i) == i && groupSize[i] % 2 == 1 && !groupOK[i]) {
			writeln("No");
			return;
		}
	}
	writeln("Yes");
}