import copy
import heapq
import itertools
import math
import operator
import sys
from bisect import bisect, bisect_left, bisect_right, insort
from collections import Counter, deque
from fractions import Fraction
from functools import cmp_to_key, lru_cache, partial
from inspect import currentframe
from math import ceil, gcd, log10, pi, sqrt

# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
# mod = 10 ** 9 + 7
mod = 998244353
# mod = 1 << 128
# mod = 10 ** 30 + 1
INF = 1 << 61
DIFF = 10 ** -9
DX = [1, 0, -1, 0, 1, 1, -1, -1]
DY = [0, 1, 0, -1, 1, -1, 1, -1]

def read_values(): return tuple(map(int, input().split()))
def read_index(): return tuple(map(lambda x: int(x) - 1, input().split()))
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for _ in range(N)]
def dprint(*values): print(*values, file=sys.stderr)
def dprint2(*values):
    names = {id(v): k for k, v in currentframe().f_back.f_locals.items()}
    dprint(", ".join(f"{names.get(id(value), '???')}={repr(value)}" for value in values))


def main():
    Q = int(input())
    XA, YA, XB, YB, XC, YC = read_list()
    L = read_lists(Q)

    def dist2(x1, y1, x2, y2):
        return (x1 - x2) ** 2 + (y1 - y2) ** 2

    def f(x1, y1, x2, y2):
        px = (x1 + x2) / 2
        py = (y1 + y2) / 2
        return dist2(px, py, x1, y1), px, py
    
    def g():
        pxl = -10 ** 9
        pxr = 10 ** 9
        pyl = -10 ** 9
        pyr = 10 ** 9

        def f1(x, y):
            d1 = dist2(x, y, XA, YA)
            d2 = dist2(x, y, XB, YB)
            d3 = dist2(x, y, XC, YC)

            return max(d1, d2, d3) - min(d1, d2, d3)


        for _ in range(10 ** 5):
            px1 = (2 * pxl + pxr)
            px2 = (pxl + 2 * pxr)
            py1 = (2 * pyl + pyr)
            py2 = (pyl + 2 * pyr)

            d1 = f1(px1, py1)
            d2 = f1(px2, py1)
            d3 = f1(px1, py2)
            d4 = f1(px2, py2)

            d = min(d1, d2, d3, d4)
            if d == d1:
                pxr = px2
                pyr = py2
            elif d == d2:
                pxl = px1
                pyr = py2
            elif d == d3:
                pxr = px2
                pyl = py1
            elif d == d4:
                pxl = px1
                pyl = py1
        return dist2(pxl, pyl, XA, YA), pxl, pyl


    d, px, py = min(
        max(
            f(XA, YA, XB, YB),
            f(XB, YB, XC, YC),
            f(XC, YC, XA, YA),
        ),
        g()
    )

    res = []
    for x, y in L:
        d2 = dist2(x, y, px, py)
        if d + DIFF >= d2:
            res.append("Yes")
        else:
            res.append("No")

    print(*res, sep="\n")


if __name__ == "__main__":
    main()