#include <cstdio>
#include <cmath>
#include <algorithm>

#define rep(i, n) for(int i = 0; i < (n); ++i)

using namespace std;

int n;
double x[22];
double y[22];
double d[22][22];

bool dfs(int k, int x, double c){
	if(x == (1 << n) - 1){
		return true;
	}
	rep(i, n){
		if(
			!(x & (1 << i)) &&
			c + d[k][i] >= d[i][n + 1]
		){
			return false;
		}
	}
	rep(i, n){
		if(
			!(x & (1 << i)) &&
			dfs(i, x | (1 << i), c + d[k][i])
		){
			return true;
		}
	}
	return false;
}

int main(){
	while(1){
		scanf("%d", &n);
		if(n == 0){
			break;
		}
		scanf("%lf%lf%lf%lf", x + n, y + n,  x + n + 1, y + n + 1);
		rep(i, n){
			scanf("%lf%lf", x + i, y + i);
		}
		rep(i, n + 2){
			rep(j, n + 2){
				double dx = x[i] - x[j];
				double dy = y[i] - y[j];
				d[i][j] = sqrt(dx * dx + dy * dy);
			}
		}
		printf("%s\n", dfs(n, 0, 0) ? "YES" : "NO");
	}
	return 0;
}