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