EPS = 1e-9
def dfs(pos, s, t)
  return true if t == $n
  (1..$n).each do |i|
    unless $used[i]
      return false if $dist[i][$n+1] < s + $dist[pos][i] + EPS
    end
  end
  (1..$n).each do |i|
    unless $used[i]
      $used[i] = true
      return true if dfs(i, s + $dist[pos][i], t + 1)
      $used[i] = false
    end
  end
  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, [x1, y1]]
  $dist = $ps.map { |x0, y0| $ps.map { |x1, y1| Math.sqrt((x1 - x0) ** 2 + (y1 - y0) ** 2) } }
  $used = [false] * ($n + 1)
  puts dfs(0, 0, 0) ? 'YES' : 'NO'
end