using System;
using System.Collections;
using System.Collections.Generic;
 
class TEST{
	static void Main(){
		Sol mySol =new Sol();
		mySol.Solve();
	}
}

class Sol{
	public void Solve(){
		E=new List<int>[N];
		for(int i=0;i<N;i++)E[i]=new List<int>();
		Mono=new HashSet<int>();
		for(int i=0;i<N;i++){
			E[(i+D[i]%N)%N].Add((N+i-D[i]%N)%N);
			E[(N+i-D[i]%N)%N].Add((i+D[i]%N)%N);
			if((N+i-D[i]%N)%N == (i+D[i]%N)%N )Mono.Add((i+D[i]%N)%N);
		}
		
		visited=new bool[N];
		compo=new int[N];
		int c=0;
		for(int i=0;i<N;i++){
			if(!visited[i])dfs(i,++c);
		}
		bool chk=true;
		for(int i=1;i<=c;i++){
			int sum=0;
			bool clear=false;
			for(int j=0;j<N;j++){
				if(compo[j]==i){
					if(W[j]==0)sum++;
					if(Mono.Contains(j))clear=true;
				}
			}
			if(!clear && sum%2==1)chk=false;
		}
		
		Console.WriteLine(chk?"Yes":"No");
	}
	
	bool[] visited;
	int[] compo;
	
	void dfs(int now,int c){
		compo[now]=c;
		visited[now]=true;
		foreach(int next in E[now]){
			if(!visited[next])dfs(next,c);
		}
	}
	
	
	
	
	HashSet<int> Mono;
	List<int>[] E;
	
	
	int N;
	int[] D;
	int[] W;
	public Sol(){
		N=ri();
		var s=rsa();
		D=new int[N];
		for(int i=0;i<N;i++)D[i]=int.Parse(s[i]);
		s=rsa();
		W=new int[N];
		for(int i=0;i<N;i++)W[i]=int.Parse(s[i]);
		//D=ria();
		//W=ria();
	}




	static String rs(){return Console.ReadLine();}
	static int ri(){return int.Parse(Console.ReadLine());}
	static long rl(){return long.Parse(Console.ReadLine());}
	static double rd(){return double.Parse(Console.ReadLine());}
	static String[] rsa(){return Console.ReadLine().Split(' ');}
	static int[] ria(){return Array.ConvertAll(Console.ReadLine().Split(' '),e=>int.Parse(e));}
	static long[] rla(){return Array.ConvertAll(Console.ReadLine().Split(' '),e=>long.Parse(e));}
	static double[] rda(){return Array.ConvertAll(Console.ReadLine().Split(' '),e=>double.Parse(e));}
}