package no074; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int[][] a = new int[n+1][n]; int[] d = new int[n]; int[] w = new int[n]; for(int i=0;i<n;i++) { d[i] = sc.nextInt(); } for(int i=0;i<n;i++) { w[i] = sc.nextInt(); } for(int i=0;i<n;i++) { int f1 = (i+d[i])%n; int f2 = ((i-d[i])%n+n)%n; a[i][f1] = a[i][f2] = 1; a[n][i] = 1 - w[i]; } int rank = 0; for(int j=0;j<n;j++) { for(int i=rank;i<n;i++) { if (a[i][j] == 0) { continue; } int[] temp = a[rank]; a[rank] = a[i]; a[i] = temp; for(int k=rank+1;k<=n;k++) { if (a[k][j] == 1) { for(int l=0;l<n;l++) { a[k][l] ^= a[rank][l]; } } } rank++; } } boolean flag = true; for(int i=0;i<n;i++) { if (a[n][i] == 1) { flag = false; } } System.out.println(flag ? "Yes" : "No"); } }