#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
const int mod=998244353;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a,bool upp=0){if(a) cout<<(upp?"YES\n":"Yes\n"); else cout<<(upp?"NO\n":"No\n");}
template<class T> void vec_out(vector<T> &p,int ty=0){
if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// oddloop
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t=1;
    //cin>>t;
    rep(i,0,t) solve();
}

void solve(){
    ll N;
    cin>>N;
    struct po
    {
        ll x;
        ll y;
    };
    vector<po> A(3);
    vector<po> p(N);
    rep(i,0,3) cin>>A[i].x>>A[i].y;
    rep(i,0,N) cin>>p[i].x>>p[i].y;
    auto del=[&](po a,po b) -> po {
        return {a.x-b.x,a.y-b.y};
    };
    auto my_pow=[&](ll a) -> ll {
        return a*a;
    };
    auto norm=[&](po a) -> ll {
        return my_pow(a.x)+my_pow(a.y);
    };
    auto add=[&](po a,po b) -> po {
        b.x*=-1;
        b.y*=-1;
        return del(a,b);
    };
    auto tmp1=del(A[0],A[1]);
    auto tmp2=del(A[0],A[2]);
    if(tmp1.x*tmp2.y==tmp2.x*tmp1.y){
        assert(false);
        sort(all(A),[&](po l,po r){
            if(l.x==r.x){
                return l.y<r.y;
            }
            return l.x<r.x;
        });
        A[1]=add(A[0],A[2]);
        A[0]=add(A[0],A[0]);
        A[2]=add(A[2],A[2]);
        ll R=norm(del(A[0],A[1]));
        rep(i,0,N){
            p[i]=add(p[i],p[i]);
            yneos(norm(del(p[i],A[1]))<=R);
        }
        return;
    }
    struct poly{
        ll x2;
        ll x1;
        ll y2;
        ll y1;
        ll c;
    };
    auto calc=[&](poly a,po b) -> ll {
        return a.x1*b.x+a.x2*b.x*b.x+a.y1*b.y+a.y2*b.y*b.y+a.c;
    };
    poly l;
    l.x2=0;
    l.y2=0;
    l.x1=(A[0].y-A[1].y);
    l.y1=(A[1].x-A[0].x);
    l.c=-(l.x1*A[0].x+l.y1*A[0].y);
    ll K1=calc(l,A[2]);
    poly C;
    C.x2=1;
    C.y2=1;
    C.x1=-(A[0].x+A[1].x);
    C.y1=-(A[0].y+A[1].y);
    C.c=(A[0].x*A[1].x)+(A[0].y*A[1].y);
    ll K2=calc(C,A[2]);
    rep(i,0,3){
        //cout<<calc(C,A[i])<<" "<<calc(l,A[i])<<endl;
    }
    if(K1<0) K1*=-1,K2*=-1;
    rep(i,0,N){
        ll tmp=K1*calc(C,p[i])-K2*calc(l,p[i]);
        yneos(tmp<=0);
    }
}