#include <bits/stdc++.h>
#define eps 1e-10
#define maxn 50005
#define double long double
#define int long long
using namespace std;
struct EDGE{int v,w;};
vector<EDGE>edge[maxn];
int KOP6th_finals;
namespace JiSuanJiHe{
    struct Point{double x,y;};
    double operator *(const Point &C,const Point &NOI){return C.x*NOI.y-C.y*NOI.x;}
    Point operator -(const Point &C,const Point &NOI){return Point{C.x-NOI.x,C.y-NOI.y};}
    Point operator +(const Point &C,const Point &NOI){return Point{C.x+NOI.x,C.y+NOI.y};}
    bool operator ==(const Point &C,const Point &D){return C.x==D.x&&C.y==D.y;}
    inline bool cmp(Point C,Point NOI){
        if(C.x!=NOI.x)return C.x<NOI.x;
        return C.y<NOI.y;
    }
    inline bool left(Point C,Point A,Point B){return (B-A)*(C-B)>=0;}
    inline bool right(Point C,Point A,Point B){return (B-A)*(C-B)<=0;}
    inline bool online(Point C,Point A,Point B){return !(right(C,A,B)||left(C,A,B));}
    inline double pf(double x){return x*x;}
    inline double dis(Point xx,Point yy){return sqrt(pf(xx.x-yy.x)+pf(xx.y-yy.y));}
    Point a[maxn],stk[maxn];
    inline void TuBao(int &n){
        int top=0,res=1;
        sort(a+1,a+1+n,cmp);
        stk[++top]=a[1];
        for(int i=2;i<=n;++i){
            while(top>=2&&right(a[i],stk[top-1],stk[top]))top--;
            stk[++top]=a[i];
        }
        for(int i=n-1;i>=1;--i){
            while(res>=2&&right(a[i],stk[top-1],stk[top]))top--,res--;
            stk[++top]=a[i];++res;
        }
        n=top-1;
        for(int i=1;i<=n;++i)a[i]=stk[i];
        return;
    }
    struct Line{double A,B,C;};
    inline Point jiao(Line A,Line B){
        if(A.A==0&&B.B==0){return Point{-B.C/B.A,-A.C/A.B};}
        else if(A.B==0&&B.A==0){return Point{-A.C/A.A,-B.C/B.B};}
        if(B.A==0||B.B==0)swap(A,B);
        if(A.A==0){
            double y=-A.C/A.B;
            double x=(-B.C-B.B*y)/B.A;
            return Point{x,y};
        }
        if(A.B==0){
            double x=-A.C/A.A;
            double y=(-B.C-B.A*x)/B.B;
            return Point{x,y};
        }
        A.B/=A.A;A.C/=A.A;A.A=1;
        B.B/=B.A;B.C/=B.A;B.A=1;
        double y=((B.C-A.C)/(A.B-B.B));
        double x=-(B.C+B.B*y)/B.A;
        return Point{x,y};
    }
    inline double dis(Point A,Line line){return fabs(A.x*line.A+A.y*line.B+line.C)/(sqrt(pf(line.A)+pf(line.B)));}
    inline double dis(Line line,Point A){return fabs(A.x*line.A+A.y*line.B+line.C)/(sqrt(pf(line.A)+pf(line.B)));}
    inline double k(Point A,Point B){return (A.y-B.y)/(A.x-B.x);}
    inline Line makeline(Point A,Point B){
        Line ans;
        if(A.x==B.x){ans.A=1;ans.B=0;ans.C=-A.x;}
        else if(A.y==B.y){ans.A=0;ans.B=1;ans.C=-A.y;}
        else{ans.A=k(A,B);ans.B=-1;ans.C=-(ans.A*A.x+ans.B*A.y);}
        return ans;
    }
    inline Line makeline(Point p,double A,double B){
        Line ANS;ANS.A=A;ANS.B=B;ANS.C=-(p.x*A+p.y*B);
        return ANS;
    }
    inline Line make_zhong_chui(Point A,Point B){
        Line czr=makeline(A,B);
        Line ans;ans.A=-czr.B;ans.B=czr.A;
        Point mid={(A.x+B.x)*0.5,(A.y+B.y)*0.5};
        ans.C=-(mid.x*ans.A+mid.y*ans.B);
        return ans;
    }
    int now,total;
    inline int update(int noi=now){
        int czr=noi+1;
        if(czr>total)czr=1;
        return czr;
    }
    inline void fix_(Point &A){
        if(A.x<=eps&&A.x>=-eps)A.x=+0.000;
        if(A.y<=eps&&A.y>=-eps)A.y=+0.000;
        return;
    }
    int vecnt=0;
    struct Vector{Point st,ed;double theta;int id;}vec[maxn];
    inline bool cmp111(Vector aaa,Vector bbb){
        if(fabs(aaa.theta-bbb.theta)>eps)return aaa.theta<bbb.theta;
        return left(aaa.ed,bbb.st,bbb.ed);
    }
    inline double angle(Vector aaa){return atan2(aaa.ed.y-aaa.st.y,aaa.ed.x-aaa.st.x);}
    inline double angle(Point aaa){return atan2(aaa.y,aaa.x);}
    inline double S(){
        double ans=0;
        for(int i=1;i<=total;++i)
            ans+=a[i]*a[update(i)];
        return ans/2;
    }
    deque<Vector>q;
    inline void Half_Pure_Memory_Foot(){
        sort(vec+1,vec+1+vecnt,cmp111);
        for(int i=1;i<=vecnt;++i){
            Point ccf=vec[i].st-vec[i].ed,ioi=vec[i-1].st-vec[i-1].ed;
            if(fabs(angle(ccf)-angle(ioi))<=eps)continue;
            Point noi=vec[i].ed-vec[i].st;
            while(q.size()>=2){
                bool f=0;
                Point Jiao=jiao(makeline(q[q.size()-1].st,q[q.size()-1].ed),makeline(q[q.size()-2].st,q[q.size()-2].ed));
                f=right(Jiao,vec[i].st,vec[i].ed);
                if(!f)break;
                q.pop_back();
            }
            while(q.size()>=2){
                bool f=0;
                Point Jiao=jiao(makeline(q[0].st,q[0].ed),makeline(q[1].st,q[1].ed));
                f=right(Jiao,vec[i].st,vec[i].ed);
                if(!f)break;
                q.pop_front();
            }
            q.push_back(vec[i]);
        }
        while(q.size()>2){
            bool f=0;
            Point Jiao=jiao(makeline(q[q.size()-1].st,q[q.size()-1].ed),makeline(q[q.size()-2].st,q[q.size()-2].ed));
            f=right(Jiao,q[0].st,q[0].ed);
            if(!f)break;
            q.pop_back();
        }
        while(q.size()>2){
            bool f=0;
            Point Jiao=jiao(makeline(q[1].st,q[1].ed),makeline(q[0].st,q[0].ed));
            f=right(Jiao,q[q.size()-1].st,q[q.size()-1].ed);
            if(!f)break;
            q.pop_front();
        }
        int noi=q.size();total=0;
    }
}
using namespace JiSuanJiHe;
inline void insert(double A,double B,double C,int id){
    Point aaa={-C/(pf(A)+pf(B))*A,-C/(pf(A)+pf(B))*B};
    Point bbb={-C/(pf(A)+pf(B))*A+B,-C/(pf(A)+pf(B))*B-A};
    vec[++vecnt]={aaa,bbb,angle(bbb-aaa),id};
}
int n;Point ak[maxn],val[maxn];
map<pair<double,double>,int>mp;
int T,startpoint=0;
double X1,Y1,X0,Y0;
inline void init(){
    for(int i=0;i<=n+1;++i)edge[i].clear();
    mp.clear();
    return;
}
int Dis[maxn];
bool in[maxn];
Vector fjx[5];
inline void solve(){
    init();
    cin>>n>>X1>>Y1>>X0>>Y0;
    init();
    Point AAA={0,0};
    Point BBB={X1,0};
    Point CCC={X1,Y1};
    Point DDD={0,Y1};
    fjx[1]={AAA,BBB,angle(BBB-AAA),n+1};
    fjx[2]={BBB,CCC,angle(CCC-BBB),n+1};
    fjx[3]={CCC,DDD,angle(DDD-CCC),n+1};
    fjx[4]={DDD,AAA,angle(AAA-DDD),n+1};
    double mindis=1e18;Point xm={X0,Y0};
    for(int i=1;i<=n;++i){
        cin>>ak[i].x>>ak[i].y;
        in[i]=1;++mp[make_pair(ak[i].x,ak[i].y)];
        // cerr<<mp[make_pair(ak[i].x,ak[i].y)]<<" ";
        if(ak[i].x<0||ak[i].y<0||ak[i].x>X1||ak[i].y>Y1)
            in[i]=0;
    }
    if(n==0){cout<<0<<"\n";return;}
    for(int i=1;i<=n;++i)mindis=min(mindis,dis(xm,ak[i]));
    for(int i=1;i<=n;++i)if(dis(xm,ak[i])==mindis)edge[startpoint].push_back({i,1});
    for(int i=1;i<=n;++i){
        if(!in[i])continue;
        vecnt=0;
        for(int j=1;j<=n;++j){
            if(i==j||(!in[j]))continue;
            insert(2*ak[i].x-2*ak[j].x,2*ak[i].y-2*ak[j].y,pf(ak[j].x)+pf(ak[j].y)-pf(ak[i].x)-pf(ak[i].y),j);
        }
        for(int j=1;j<=4;++j)vec[++vecnt]=fjx[j];
        Half_Pure_Memory_Foot();
        if(q.size()>=2){
            Vector PRE;
            while(q.size()){
                auto now=q.front();q.pop_front();
                if(now.id==n+1){
                    auto nxt=q[0];
                    auto ccf=jiao(makeline(nxt.st,nxt.ed),makeline(PRE.st,PRE.ed));
                    auto CCF=makeline(now.st,now.ed);
                    int val=0;
                    if(ccf.x*CCF.A+ccf.y*CCF.B+CCF.C==0)val=2;
                    edge[i].push_back({now.id,val});
                }
                else edge[i].push_back({now.id,mp[make_pair(ak[now.id].x,ak[now.id].y)]});
                PRE=now;
            }
        }
        while(q.size())q.pop_front();
    }
    for(int i=1;i<=n+1;++i)Dis[i]=1e18;Dis[0]=0;
    priority_queue<pair<int,int>>Q;Q.push(make_pair(0,0));
    while(Q.size()){
        auto now=Q.top();Q.pop();
        for(auto E:edge[now.second]){
            int v=E.v,w=E.w;
            if(Dis[v]>Dis[now.second]+w){
                Dis[v]=Dis[now.second]+w;
                Q.push(make_pair(-Dis[v],v));
            }
        }
    }
    // for(int i=0;i<=n;++i){
    //     for(auto v:edge[i]){
    //         cerr<<i<<" "<<v.v<<" "<<v.w<<"\n";
    //     }
    // }
    cout<<Dis[n+1]<<"\n";
    return;
}
signed main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin>>T;while(T--)solve();
    return 0;
}