#include <iostream>
#include <queue>
#include <map>
#include <list>
#include <vector>
#include <string>
#include <limits>
#include <cassert>
#include <fstream>
#include <cstring>
#include <bitset>
#include <iomanip>
#include <algorithm>
#include <functional>
#include <cstdio>
#include <ciso646>
#include <array>

using namespace std;

#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)

#define inf 0x3f3f3f3f
#define CLEAR(a) a = decltype(a)()
#define MP make_pair
#define ALL(a) (a).begin(),(a).end()
#define pii pair<int ,int>
#define pcc pair<char,char>
#define pic pair<int,char>
#define pci pair<char,int>
#define VS vector<string>
#define VI vector<int>
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define pi 2*acos(0.0)
#define INFILE() freopen("in.txt","r",stdin)
#define OUTFILE() freopen("out.txt","w",stdout)
#define ll long long
#define ull unsigned long long
#define eps 1e-14
#define FIN std::ifstream cin("D:\input.txt")

class union_find {
private:
	vector<int> par;
	vector<int> rank;
public:

	union_find(int N) {
		par.resize(N);
		rank.resize(N);
		for (int i = 0; i < N; ++i) {
			par[i] = i;
			rank[i] = 0;
		}
	}

	int find(int x) {
		if (par[x] == x) {
			return x;
		}
		else {
			return par[x] = find(par[x]);
		}
	}

	void unite(int x, int y) {
		x = find(x);
		y = find(y);
		if (x == y) return;

		if (rank[x] < rank[y]) {
			par[x] = y;
		}
		else {
			par[y] = x;
			if (rank[x] == rank[y]) rank[x]++;
		}
	}

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


int main(void) {
	int N; cin >> N;
	vector<int> D(N); for (auto &a : D) cin >> a;
	vector<int> W(N); for (auto &a : W) cin >> a;
	union_find uf(N);
	REP(i, N) {
		if ((i + D[i]) % N == (i+N*1000-D[i]) % N) {
			W[(i + D[i]) % N] = -inf;
		}
		uf.unite((i + D[i]) % N, (i+N*1000-D[i]) % N);
	}

	vector<int> count(N);
	REP(i,N){
		if (W[i] < 0) count[uf.find(i)] += W[i];
		else count[uf.find(i)] += (W[i] == 0);
	}

	bool res = true;
	REP(i, N) {
		if (count[i] < 0) continue;
		if (count[i] % 2 != 0) {
			res = false;
			break;
		}
	}

	cout << (res ? "Yes" : "No") << endl;

	return 0;
}