//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define int ll
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
ll normalize(ll a,ll b)
{
	if(!b) return a;
	return (a%b+b)%b;
}
void exgcd(ll a,ll b,ll x,ll y)
{
	if(!b)
	{
		x=1;
		y=0;
		return ;
	}
	exgcd(b,a%b,y,x);
	y-=(a/b)*x;
}
ll getr(ll a,ll b)
{
	ll x,y;
	exgcd(a,b,x,y);
	return (x%b+b)%b;
}
pair<ll,ll> genM(pair<ll,ll> pr,ll K)
{
	ll g=__gcd(pr.second,K);
	if(pr.first%g) return mp(-1,-1);
	K/=g;
	pr.second/=g;
	pr.first/=g;
	ll need=(K-pr.first%K)%K;
	ll ch1=getr(pr.second,K);
	longer dest=pr.first+(longer)(need)*ch1*pr.second;
	assert(dest%K==0);
	dest/=K;
	return mp(dest,pr.second);
}
signed main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int t;
	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		int allPassO=1;
		int allSlopeOk=1;
		int allAlign=1;
		ll gcdX=0,gcdY=0;
		ll gcdK=0;
		vector<ll> vK;
		for(int i=1;i<=n;i++)
		{
			ll a,b,c,d;
			cin>>a>>b>>c>>d;
			if(a*d!=b*c) allPassO=0;
			if(a!=c&&b!=d&&abs(a-c)!=abs(b-d)) allSlopeOk=0;
			if(a!=c&&b!=d) allAlign=0;
			if(a==c) gcdX=__gcd(gcdX,2*abs(a));
			if(b==d) gcdY=__gcd(gcdY,2*abs(b));
			if(a+b==c+d)
			{
				gcdK=__gcd(gcdK,abs(a+b));
				vK.pb(abs(a+b));
			}
			if(a-b==c-d)
			{
				gcdK=__gcd(gcdK,abs(a-b));
				vK.pb(abs(a-b));
			}
		}
		int q;
		cin>>q;
		for(int i=1;i<=q;i++)
		{
			ll a,b,c,d;
			cin>>a>>b>>c>>d;
			if(allPassO&&allSlopeOk)
			{
				if(allAlign)
					cout<<((abs(a)==abs(c)&&abs(b)==abs(d))?"Yes\n":"No\n");
				else
					cout<<(((abs(a)==abs(c)&&abs(b)==abs(d))||(abs(b)==abs(c)&&abs(a)==abs(d)))?"Yes\n":"No\n");
			}
			else if(allPassO)
				cout<<((a*a+b*b==c*c+d*d)?"Yes\n":"No\n");
			else if(allSlopeOk)
			{
				if(allAlign)
				{
					int okX=1;
					int okY=1;
					if(gcdX) okX=((a-c)%gcdX==0||(a+c)%gcdX==0);
					else okX=(a-c==0||a+c==0);
					if(gcdY) okY=((b-d)%gcdY==0||(b+d)%gcdY==0);
					else okY=(b-d==0||b+d==0);
					cout<<((okX&&okY)?"Yes\n":"No\n");
				}
				else
				{
					int flag=0;
					ll g=__gcd(gcdX,gcdY);
					ll gcdK2=0;
					for(int i=0;i<sz(vK);i++)
						gcdK2=__gcd(gcdK2,vK[0]+vK[i]);
					for(int dx=-1;dx<=1;dx+=2)
						for(int dy=-1;dy<=1;dy+=2)
						{
							ll X=c-dx*a;
							ll Y=d-dy*b;
							if(g)
							{
								if((X-Y)%g==0)
								{
									ll g2=__gcd(g,gcdK2);
									if(X%g2==0) flag=1;
								}
							}
							else
							{
								if(X==Y&&(gcdK2==0?X==0:(X%gcdK2==0))) flag=1;
							}
						}
					for(int dx=-1;dx<=1;dx+=2)
						for(int dy=-1;dy<=1;dy+=2)
						{
							ll X=c-dx*b-vK[0];
							ll Y=d-dy*a-vK[0];
							if(g)
							{
								if((X-Y)%g==0)
								{
									ll g2=__gcd(g,gcdK2);
									if(X%g2==0) flag=1;
								}
							}
							else
							{
								if(X==Y&&(gcdK2==0?X==0:(X%gcdK2==0))) flag=1;
							}
						}
					cout<<(flag?"Yes\n":"No\n");
				}
			}
			else
				cout<<"Yes\n";
		}
	}
	return 0;
}