#include <iostream>
#include <vector>
#include <cmath>
#include <map>
using namespace std;

typedef pair<int,int> point;

int N;
point Y,M;
vector<point> C;
vector<bool> CC;

double dist(point p1, point p2){
	double dx = p2.first - p1.first;
	double dy = p2.second - p1.second;
	return sqrt(dx * dx + dy * dy); 
}

bool solve(point pos, double time, int corrected){
#ifdef DEBUG
	for(int i=0; i<CC.size(); i++){
		cout << ( CC[i] ? "O" : "X" );
	}	
	cout << endl;
#endif

	if(corrected == C.size()){ return true; }
	for(int i=0; i<C.size(); i++){
		if(!CC[i]){
			double time2 = time + dist(pos, C[i]);
			bool ok = true;
			for(int j=0; j<C.size(); j++){
				if(!CC[j] && time2 + dist(C[i], C[j]) >= dist(M, C[j])){
				  ok = false;
				  break;
				}
			}
			if(ok){
				CC[i] = true;
				if(solve(C[i], time2, corrected+1)){
					return true;
				}
				CC[i] = false;
			}
		}
	}
	return false;
}

int main(){
	int yx, yy, mx, my;
	vector<bool> cc;
	while(cin >> N >> yx >> yy >> mx >> my){
		Y = make_pair(yx,yy);
		M = make_pair(mx,my);
		if(N == 0){ break; }
		C.clear();
		CC.clear();
		for(int i=0; i<N; i++){
			int cx, cy;
			cin >> cx >> cy;
			C.push_back(make_pair(cx,cy));
			CC.push_back(false);
		}
		if(solve(Y, 0, 0)){
			cout << "YES" << endl;
		}else{
			cout << "NO" << endl;
		}
	}
	return 0;
}