#include<bits/stdc++.h>
using namespace std;
#include<atcoder/all>
using namespace atcoder;
using ll = long long;
int n;
vector<int> D,W;

void solve(){
	vector<vector<int>> G(n);
	for(int i = 0;i<n;i++){
		int l = (i+n*1000-D[i])%n;
		int r = (i+D[i])%n;
		if(r<l)swap(l,r);
		G[l].push_back(r);
		//l<=r
	}
	
	for(int i = 0;i<n;i++){
		sort(G[i].begin(),G[i].end());
		if(W[i]==0&&G[i].size()){
			int j = G[i].front();
			if(j==i){
				W[i]=1;
			}else{
				W[i] = 1;
				W[j] ^= 1;
			}
		}
	}
	vector<vector<int>> rG(n);
	for(int i = 0;i<n;i++){
		sort(rG[i].begin(),rG[i].end());
		int l = (i+n*1000-D[i])%n;
		int r = (i+D[i])%n;
		if(r<l)swap(l,r);
		rG[r].push_back(l);
	}
	for(int i = n-1;i>=0;i--){
		sort(rG[i].begin(),rG[i].end());
		if(W[i]==0&&rG[i].size()){
			int j = rG[i].back();
			if(j==i){
				W[i]=1;
			}else{
				W[i] = 1;
				W[j] ^= 1;
			}
		}
		//for(auto &i:W)cout<<i<<' ';cout<<endl;
	}
	sort(W.begin(),W.end());
	if(W[0]==0){
		cout<<"No"<<endl;
	}else{
		cout<<"Yes"<<endl;
	}

}

signed main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	cin >> n;
	D = vector<int>(n);
	W = vector<int>(n);
	for(auto &i:D)cin >> i;
	for(auto &i:W)cin >> i;
	solve();
}