lib C
  fun strtoll(s : UInt8*, p : UInt8**, b : Int32) : Int64
end

class String
  def to_i64
    C.strtoll(self, nil, 10)
  end
end

class UnionFind
  @d : Array(Int32)

  def initialize(@n : Int32)
    @d = Array.new(n, -1)
  end

  def root(x : Int32)
    @d[x] < 0 ? x : (@d[x] = root(@d[x]))
  end

  def unite(x : Int32, y : Int32)
    x = root(x)
    y = root(y)
    return false if x == y
    x, y = y, x if @d[x] > @d[y]
    @d[x] += @d[y]
    @d[y] = x
    true
  end

  def same?(x : Int32, y : Int32)
    root(x) == root(y)
  end

  def size(x : Int32)
    -@d[root(x)]
  end

  def groups
    groups = Hash(Int32, Set(Int32)).new { |h, k| h[k] = Set(Int32).new }
    @n.times do |i|
      groups[root(i)] << i
    end
    groups.values.to_set
  end
end

n = read_line.to_i
a = read_line.split.map(&.to_i)
b = read_line.split.map(&.to_i)

flag = [false] * n
uf = UnionFind.new(n)
n.times do |i|
  v1 = (i + a[i]) % n
  v2 = (i - a[i]) % n
  if v1 == v2
    flag[v1] = true
  else
    uf.unite(v1, v2)
  end
end
puts uf.groups.all? { |set|
  f1 = set.any? { |i| flag[i] }
  f2 = set.count { |i| b[i] == 0 }.even?
  f1 || f2
} ? "Yes" : "No"