/**
 *  Dragon Fantasy (Problem C, Practice Contest for Japan Domestic, 2005-06-19)
 *  by Kenji Inoue, 2006-12-30
 **/

#include <iostream>
#include <cmath>

using namespace std;

#define EPS (1e-10)

int n, dx, dy;
bool answer;
int cx[20], cy[20]; // crystals
bool done[20];

double dist(int x, int y) {
  return sqrt(x*x + y*y);
}

void solve(double t, int x, int y) {
  if (answer) { return; }

  int collected = 0;
  for (int i=0; i<n; i++) {
    if (done[i]) { collected++; }
  }
  if (collected == n) {
    answer = true;
    return;
  }

  // return if one of the 1-step paths is unreachable
  for (int i=0; i<n; i++) {
    if (done[i]) { continue; }

    double nt = t + dist(cx[i]-x, cy[i]-y); // next time
    if ( dist(dx-cx[i], dy-cy[i]) < nt + EPS ) { return; }
  }

  for (int i=0; i<n; i++) {
    if (done[i]) { continue; }

    done[i] = true;
    double nt = t + dist(cx[i]-x, cy[i]-y); // next time
    solve(nt, cx[i], cy[i]);
    done[i] = false;
  }
}

int main() {
  int hx, hy;
  while (cin >> n >> hx >> hy >> dx >> dy, (n || hx || hy || dx || dy)) {
    for (int i=0; i<n; i++) {
      cin >> cx[i] >> cy[i];
    }
    memset(done, false, sizeof(done));

    answer = false;
    solve(0.0, hx, hy);
    if (answer) {
      cout << "YES" << endl;
    } else {
      cout << "NO" << endl;
    }
  }

  return 0;
}