#include<bits/stdc++.h>
#define inf 0x3f3f3f3f3f3f3f3fll
#define debug(x) cerr<<#x<<"="<<x<<endl
using namespace std;
using ll=long long;
using ld=long double;
using pli=pair<ll,int>;
using pi=pair<int,int>;
template<typename A>
using vc=vector<A>;
template<typename A,const int N>
using aya=array<A,N>;
inline int read()
{
    int s=0,w=1;char ch;
    while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    return s*w;
}
inline ll lread()
{
    ll s=0,w=1;char ch;
    while((ch=getchar())>'9'||ch<'0') if(ch=='-') w=-1;
    while(ch>='0'&&ch<='9') s=s*10+ch-'0',ch=getchar();
    return s*w;
}
ll a[2005],b[2005],c[2005],d[2005];
ll A[2005],B[2005],C[2005],D[2005];
int n,m;
inline bool check()
{
    for(int i=1;i<=n;i++)
    {
        if(a[i]==c[i]||b[i]==d[i]) continue;
        ll X=abs(a[i]-c[i]),Y=abs(b[i]-d[i]);
        if(X!=Y) return true;
    }
    return false;
}
inline ll P(ll a){ return a*a;}
inline bool checkO()//所有直线都过原点
{
    for(int i=1;i<=n;i++) if(b[i]*c[i]!=d[i]*a[i]) return false;
    return true;
}
inline bool check13()
{
    for(int i=1;i<=n;i++) if(a[i]!=c[i]&&b[i]!=d[i]) return true;
    return false;
}
inline ll gcd(ll a,ll b)
{
    if(!a||!b) return a|b;
    a=abs(a),b=abs(b);
    ll r=a%b;
    while(r)
    {
        a=b;
        b=r;
        r=a%b;
    }
    return b;
}
inline bool MOD(ll a,ll mod)
{
    return (a%mod+mod)%mod;
}
inline bool check(ll a,ll b,ll g)
{
    if(!g) return abs(a)==abs(b);
    if(MOD(a,2*g)==MOD(b,2*g)) return true;
    return MOD(-a,2*g)==MOD(b,2*g);
}
inline void solve()
{
    n=read();
    for(int i=1;i<=n;i++) a[i]=read(),b[i]=read(),c[i]=read(),d[i]=read();
    m=read();
    for(int i=1;i<=m;i++) A[i]=read(),B[i]=read(),C[i]=read(),D[i]=read();
    //存在好的交点
    if(check())
    {
        bool f=checkO();
        for(int i=1;i<=m;i++)
        {
            if(!f) printf("Yes\n");//存在不为原点的好的交点
            else if(P(A[i])+P(B[i])==P(C[i])+P(D[i])) printf("Yes\n");
            else printf("No\n");
        }
        return ;
    }
    //不存在好的交点
    if(checkO())//所有点都过原点
    {
        int f1=0,f3=0;
        for(int i=1;i<=n;i++) if(a[i]!=c[i])
        {
            ll k=(d[i]-b[i])/(c[i]-a[i]);
            if(k==1) f1=1;else f3=1;
        }
        for(int i=1;i<=m;i++)
        {
            bool ok=0;
            for(int o1=0;o1<=f1;o1++) for(int o3=0;o3<=f3;o3++)
            {
                int X=A[i],Y=B[i];
                if(o1) swap(X,Y);
                if(o3) swap(X,Y),X=-X,Y=-Y;
                if(abs(X)==abs(C[i])&&abs(Y)==abs(D[i])) ok=1;
            }
            if(ok) printf("Yes\n");
            else printf("No\n");
        }
        return ;
    }
    //不存在1或3型直线
    if(!check13())
    {
        ll gx=0,gy=0;
        for(int i=3;i<=n;i++)
        {
            if(a[i]==c[i]) gx=gcd(gx,a[i]);
            else gy=gcd(gy,b[i]);
        }
        for(int i=1;i<=m;i++) if(check(A[i],C[i],gx)&&check(B[i],D[i],gy)) printf("Yes\n");
            else printf("No\n");
        return ;
    }
    //存在不过原点的1/3型直线
    //按照与x轴的交点,存储所有1型直线
    vc<ll>X;ll g=0;
    for(int i=1;i<=n;i++)
    {
        if(a[i]==c[i]||b[i]==d[i]) continue;
        ll k=(d[i]-b[i])/(c[i]-a[i]);
        if(k==1) X.push_back(a[i]-c[i]);
        else X.push_back(a[i]+c[i]);
    }
    assert(X.size());
    for(int i=1;i<=n;i++)
    {
        if(a[i]==c[i]) g=gcd(g,a[i]);
        else g=gcd(g,b[i]-X[0]);
    }
    ll W=0;
    for(unsigned i=1;i<X.size();i++) W=gcd(W,X[i]-X[0]);
    W+=X[0];
    for(int i=1;i<=m;i++)
    {
        bool ok=0;
        for(int o1=0;o1<2;o1++) for(int o3=0;o3<2;o3++)
        {
            ll nx=A[i],ny=B[i];
            if(o1) swap(nx,ny),nx+=X[0],ny-=X[0];
            if(o3) swap(nx,ny),nx=W-nx,ny=W-ny;
            if(check(nx,C[i],g)&&check(ny,D[i],g)) ok=1;
        }
        if(ok) printf("Yes\n");
        else printf("No\n");
    }
}
int main()
{
    int T=read();
    while(T--) solve();
    return 0;
}