#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
#include <sstream>
 
#include <algorithm>
#include <cmath>
 
#include <string>
//#include <array>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
 
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
/////////
using namespace::std;
/////////
int grope=0;
bool g[100];
int dp[100];
int sumG[100];

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    cout << setprecision(16);//
	
	int N;
	cin>>N;
	int D[100];
	bool W[100];
	int ww;
	rep(i,N)cin>>D[i];
	rep(i,N){
		cin>>ww;
		W[i] = ww?true:false;
	}
	int tr,tl;
	
	
	rep(i,N){
		tr = (i+D[i])%N;
		tl = (N+i+(-D[i])%N)%N;
		if( dp[tr] == 0 && dp[tl] == 0){
			++grope;
			dp[tr] = grope;
			dp[tl] = grope;
			if( tr == tl){
				g[grope] = true;
			}
		}else if( dp[tr] == 0){
			dp[tr] = dp[tl];
		}else if( dp[tl] == 0){
			dp[tl] = dp[tr];
		}else{
			if( tl == tr){
				g[ dp[tl] ] = true;
			}else{
				int gmin = min(dp[tl],dp[tr]);
				int gother = max(dp[tl],dp[tr]);
				rep(i,N){
					if( dp[i] == gother){
						dp[i] = gmin;
					}
				}
				if( g[ gother ] ){
					g[gother] = false;
					g[gmin] = true;
				}
			}
		}
	}
	
	rep(i,N){
		if(!W[i]){
			++sumG[ dp[i] ];
		}
	}
	if(sumG[0]){
		P("No");
		return 0;
	}
	for(int i=1;i<=grope;++i){
		if( g[i] == false && sumG[i]%2 != 0 ){
			P("No");
			return 0;
		}
	}
	P("Yes");
	return 0;
}
//gv