#include <bits/stdc++.h>

using namespace std;

int gcd(int x, int y)
{
	return x ? gcd(y % x, x) : y;
}
void fold(int &a, int &b, int x, int y)
{
	if(x)
	{
		a = (a % (2 * x) + 2 * x) % (2 * x);
		a = min(a, 2 * x - a);
	}
	if(y)
	{
		b = (b % (2 * y) + 2 * y) % (2 * y);
		b = min(b, 2 * y - b);
	}
}
void wow(int &a, int &b, int x)
{
	fold(a, b, x, x);
	if(a + b >= x)
	{
		a = x - a;
		b = x - b;
		swap(a, b);
	}
}
void solve()
{
	int n, q, i, a, b, c, d;
	int x = 0, y = 0, z = 0;
	bool f = 0, g = 0;
	scanf("%d", &n);
	for(i = 1; i <= n; i++)
	{
		scanf("%d%d%d%d", &a, &b, &c, &d);
		if(a == c)
		{
			x = gcd(x, abs(a));
			continue;
		}
		if(b == d)
		{
			y = gcd(y, abs(b));
			continue;
		}
		if(a + b == c + d)
		{
			z = gcd(z, abs(a + b));
			g = 1;
			continue;
		}
		if(a - b == c - d)
		{
			z = gcd(z, abs(a - b));
			g = 1;
			continue;
		}
		f = 1;
	}
	scanf("%d", &q);
	if(f)
	{
		while(q--)
		{
			scanf("%d%d%d%d", &a, &b, &c, &d);
			printf("Yes\n");
		}
		return ;
	}
	if(!g)
	{
		while(q--)
		{
			scanf("%d%d%d%d", &a, &b, &c, &d);
			fold(a, b, x, y);
			fold(c, d, x, y);
			if(a == c && b == d)
				printf("Yes\n");
			else
				printf("No\n");
		}
		return ;
	}
	z = gcd(z, gcd(x, y));
	x = y = z;
	while(q--)
	{
		scanf("%d%d%d%d", &a, &b, &c, &d);
		wow(a, b, x);
		wow(c, d, x);
		if(a == c && b == d)
			printf("Yes\n");
		else
			printf("No\n");
	}
}

int main()
{
	int t;
	scanf("%d", &t);
	while(t--)
		solve();
	return 0;
}