#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e4+5;
const double eps=1e-12,pi=acos(-1);
struct node{
	double x,y;
	friend node operator-(node a,node b){
		return {a.x-b.x,a.y-b.y};
	}
	friend node operator*(double a,node b){
		return {a*b.x,a*b.y};
	}
	friend node operator+(node a,node b){
		return {a.x+b.x,a.y+b.y};
	}
}p[N],st,ed;
double dis(node a,node b){
    return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
double jj(node x){
	return atan2(x.y,x.x);
}
bool chk(double x){
	return abs(x)<=eps;
}
double cro(node a,node b){
	return a.x*b.y-a.y*b.x;
}
struct vec{
	node a,b;
	int bh;
	friend bool operator<(vec a,vec b){
		if(chk(jj(a.b-a.a)-jj(b.b-b.a)))return cro(a.a-b.a,b.b-b.a)<-eps;
		return jj(a.b-a.a)<jj(b.b-b.a);
	}
};
node jd(vec a,vec b){
	double k=cro(a.a-b.a,b.b-b.a)/cro(b.b-b.a,a.b-a.a);
	return a.a+k*(a.b-a.a);
}
bool chk(vec a,vec b,vec c){
	auto x=jd(a,b);
	return cro(x-c.a,c.b-c.a)>-eps;
}
double S(node a,node b,node c){
	return cro(b-a,c-a)/2;
}
node rot(node a,double x){
	return {a.x*cos(x)-a.y*sin(x),a.x*sin(x)+a.y*cos(x)};
}
vec zc(node a,node b){
	node x=0.5*(a+b),tmp=rot(b-a,pi/2);
	return {x,x+tmp};
}
vector<vec>q;
vec qs[N];
node g[N];
vector<int>e[N];
int n,hd,tl,d[N],t;
void solve(){
	sort(q.begin(),q.end());
	vector<vec>tmp;
	double lst=1e9;
	for(auto c:q){
		if(chk(jj(c.b-c.a)-lst))continue;
		lst=jj(c.b-c.a);
		tmp.push_back(c);
	}
	q=tmp;
	hd=1;tl=0;
	for(auto c:q){
		while(hd<tl&&chk(qs[tl-1],qs[tl],c))tl--;
		while(hd<tl&&chk(qs[hd+1],qs[hd],c))hd++;
		qs[++tl]=c;
	}
	while(hd<tl&&chk(qs[tl-1],qs[tl],qs[hd]))tl--;
}
deque<int>qq;
signed main(){
	cin>>t;
	while(t--){
		cin>>n;
		cin>>ed.x>>ed.y>>st.x>>st.y;
		for(int i=1;i<=n;i++)cin>>p[i].x>>p[i].y,e[i].clear();
		for(int i=1;i<=n;i++){
			q.clear();
			for(int j=1;j<=n;j++){
				if(i==j)continue;
			    auto tmp=zc(p[i],p[j]);
			    tmp.bh=j;
			    q.push_back(tmp);
			}
			q.push_back({{0,0},{1,0},n+1});
			q.push_back({{ed.x,0},{ed.x,1},n+1});
			q.push_back({{ed.x,ed.y},{ed.x-1,ed.y},n+1});
			q.push_back({{0,ed.y},{0,0},n+1});
			solve();
			for(int j=hd;j<=tl;j++)e[i].push_back(qs[j].bh);
		}
		memset(d,0x3f,sizeof(d));
		int wz=1;
		for(int i=2;i<=n;i++){
			if(dis(p[i],st)<dis(p[wz],st))wz=i;
		}
		d[wz]=0;
		qq.push_back(wz);
		while(qq.size()){
			int x=qq.front();
			qq.pop_front();
			for(auto c:e[x]){
				if(d[c]>d[x]+1){
					d[c]=d[x]+1;
					qq.push_back(c);
				}
			}
		}
		cout<<d[n+1]<<"\n";
	}
}