def dfs(pos, dx, dy, t)
  if ($x1 - $ps[pos][0]) ** 2 + ($y1 - $ps[pos][1]) ** 2 > dx ** 2 + dy ** 2
    $used[pos] = true
    t += 1
  else
    return false
  end
  return true if t == $n + 1
  ($n + 1).times do |i|
    unless $used[i]
      return true if dfs(i, dx + ($ps[pos][0] - $ps[i][0]).abs, dy + ($ps[pos][1] - $ps[i][1]).abs, t)
    end
  end
  $used[pos] = false
  false
end

while l = gets
  $n, x0, y0, $x1, $y1 = l.split.map(&:to_i)
  break if $n == 0
  ps = $n.times.map { gets.split.map(&:to_i) }
  $ps = [[x0, y0], *ps]
  $used = [false] * ($n + 1)
  puts dfs(0, 0, 0, 0) ? 'YES' : 'NO'
end