def solve(x0, y0, x, y, ds, ac)
  return ac if x0 == x && y0 == y
  ell = [(x - x0).abs, (y - y0).abs].max
  ds.each do |d|
    return ac + 1 if d == ell
  end

  maxd = ds[0]

  if ell >= 2 * maxd
    if x0 < x
      x0 += maxd
    else
      x0 -= maxd
    end
    if y0 < y
      y0 += maxd
    else
      y0 -= maxd
    end
    return solve(x0, y0, x, y, ds, ac + 1)
  end

  ac + 2
end

_ = gets.to_i
ds = gets.split.map(&:to_i)
ds.sort!
ds.reverse!
x, y = gets.split.map(&:to_i)

p solve(0, 0, x, y, ds, 0)