#include <vector>
#include <bitset>
#include <iostream>
#include <algorithm>
#define coor(i,j) ((i)+(j)*m)
#define in(i,j) (0<=(i)&&(i)<m&&0<=(j)&&(j)<n)
using namespace std;
vector<bitset<101> > M(100);
int main(){
	int n,d,w;
	int i,j;
	cin>>n;
	for(i=0;i<n;i++){
		cin>>d;
		M[i][(i+d)%n]=1;
		M[i][(i-d+n)%n]=1;
	}
	for(i=0;i<n;i++){
		cin>>w;
		M[i][n]=w^1;
	}
	int k=0;
	for(i=0;i<n;i++){
		for(j=k;j<n&&!M[j][i];j++);
		if(j==n)continue;
		swap(M[k],M[j]);
		for(j=k+1;j<n;j++)if(M[j][i])M[j]^=M[k];
		k++;
	}
	int ans=1;
	for(j=0;j<n;j++)if(M[j][n]&&M[j].count()==1)ans=0;
	cout<<(ans?"Yes":"No")<<endl;
}