#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N=2002;
int gcd(vector<int> v){ return accumulate(v.begin(),v.end(),0,__gcd<int>); }
void solve(){
	int n,m;
	scanf("%d",&n);
	bool irr=false,off=false;
	vector<int> ver,hor,cut;
	for(int i=1;i<=n;i++){
		int a,b,c,d;
		scanf("%d%d%d%d",&a,&b,&c,&d);
		int dx=c-a,dy=d-b;
		if((ll)a*d!=(ll)b*c) off=true; 
		if(dx==0) ver.push_back(abs(a));
		else if(dy==0) hor.push_back(abs(b));
		else if(dx==dy) cut.push_back(abs(a-b));
		else if(dx==-dy) cut.push_back(abs(a+b));
		else irr=true;
	}
	scanf("%d",&m);
	function<pair<int,int>(int,int)> sim;
	if(irr){
		if(off){
			sim=[&](int x,int y)->pair<int,int>{return{0,0};};
		}else{
			sim=[&](int x,int y)->pair<int,int>{
				ll res=(ll)x*x+(ll)y*y;
				return {res>>32,res};
			};
		}
	}else if(cut.empty()){
		int gv=gcd(ver),gh=gcd(hor);
		sim=[=](int x,int y)->pair<int,int>{
			if(gv) x%=2*gv;
			if(gh) y%=2*gh;
			return {min(x,2*gv-x),min(y,2*gh-y)};
		};
	}else{
		int gs=__gcd(__gcd(gcd(ver),gcd(hor)),gcd(cut));
		bool add=false;
		if(gs) for(int i:cut) if(i%(2*gs)==0) add=true;
		sim=[=](int x,int y)->pair<int,int>{
			if(!gs) return {min(x,y),max(x,y)};
			x%=2*gs; y%=2*gs;
			if(x>gs) x=2*gs-x;
			if(y>gs) y=2*gs-y;
//			if(x+y>gs) swap(x,y),x=gs-x,y=gs-y;
//			if(add&&x>y) swap(x,y);
			return {x,y};
		};
	}
	while(m--){
		int x,y,z,w;
		scanf("%d%d%d%d",&x,&y,&z,&w);
		x=abs(x); y=abs(y); z=abs(z); w=abs(w);
		puts(sim(x,y)==sim(z,w)?"Yes":"No");
	}
}
int main(){
	int tc;
	scanf("%d",&tc);
	while(tc--){
		solve();
	}
}