#define _CRT_SECURE_NO_WARNINGS
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii;
typedef long long ll; typedef vector<long long> vl; typedef pair<long long,long long> pll; typedef vector<pair<long long,long long> > vpll;
typedef vector<string> vs; typedef long double ld;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

bool gaussian_elimination(vector<vector<bool> > A, vector<bool> b) {
	const int n = A.size(), m = A[0].size();
	vector<bool> used(n);
	rep(j, m) {
		int i = 0;
		while(i < n && (used[i] || !A[i][j]))
			i ++;
		if(i == n) continue;
		used[i] = true;
		rep(k, n) if(!used[k] && A[k][j]) {
			rep(l, m)
				A[k][l] = A[k][l] ^ A[i][l];
			b[k] = b[k] ^ b[i];
		}
	}
	rep(i, n) if(!used[i] && b[i]) return false;
	return true;
}


int main() {
	int N;
	scanf("%d", &N);
	vector<int> D(N);
	rep(i, N) scanf("%d", &D[i]);
	vector<int> W(N);
	rep(i, N) scanf("%d", &W[i]);
	vector<vector<bool> > A(N, vector<bool>(N, false));
	rep(i, N) {
		int l = ((i - D[i]) % N + N) % N, r = (i + D[i]) % N;
		A[l][i] = A[r][i] = true;
	}
	vector<bool> b(N);
	rep(i, N)
		b[i] = W[i] == 0;
	bool ok = gaussian_elimination(A, b);
	puts(ok ? "Yes" : "No");
	return 0;
}