#include "bits/stdc++.h"

#include <stdio.h>
#include <math.h>

#include "atcoder/all"
#include <float.h>

#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;

const double eps = 1e-9;

#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPDI(i, init, n) for (ll i = init; i >=n; --i)
#define REPE(i, c) for (const auto& i : c)
#define TCASE() ll _ttt; cin >> _ttt; while(_ttt--)

using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
#define VL(a, n) vector<ll> a; a.assign(n, 0);
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);
using vd = vector<double>;
using pl = pair<ll, ll>;

struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>; using vvm = vector<vm>;

void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };

const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値
auto gmax(const auto& a, const auto& b) { return a > b ? a : b; };
auto gmin(const auto& a, const auto& b) { return a < b ? a : b; };
bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; }
bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; }
template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };
template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };
template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };
template<class T, class K = T::key_type, class V = T::mapped_type> [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); }
long long ceil(const long long a, const long long b) { return (a + b - 1) / b; }

struct xy {
    double x;
    double y;

    bool operator<(const xy& r) const {
		return x < r.x;
	}
};

// 3点を通る円の中心と半径を求める
// 3点が一直線上にある場合はnanを返す
tuple<double, double, double> circle_center(const xy& a, const xy& b, const xy& c) {
	double x1 = a.x, y1 = a.y;
	double x2 = b.x, y2 = b.y;
	double x3 = c.x, y3 = c.y;
	double x = ((y1 - y2) * (x3*x3 - x1*x1 + y3*y3 - y1*y1) - (y1 - y3) * (x2*x2 - x1*x1 + y2*y2 - y1*y1)) / (2 * (x1-x2)*(y1-y3) - 2 * (x1-x3) * (y1-y2));
	double y = ((x1-x3)*(x2*x2 - x1*x1 + y2*y2 - y1*y1) - (x1-x2)*(x3*x3 - x1*x1 + y3*y3 - y1*y1)) / (2*(x1-x2)*(y1-y3) - 2*(x1-x3)*(y1-y2));
	double r = sqrt((x1 - x) * (x1 - x) + (y1 - y) * (y1 - y));
	return { x, y, r };
}

xy center(const xy& a, const xy& b) {
    return { (a.x + b.x) / 2 , (a.y + b.y) / 2 };
}

double len(const xy& a, const xy& b) {
    return std::sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << std::fixed << std::setprecision(10);

    ll q;
    cin >> q;
    xy a, b, c;
    cin >> a.x >> a.y >> b.x >> b.y >> c.x >> c.y;

    vector<pair<double, xy>> d = {
        {len(a, b), center(a, b)}, {len(b, c), center(b, c)}, {len(c, a), center(c, a)}
    };
    mysort(d);

    double cx, cy, r = 0;
    if (d[0].first + d[1].first < d[2].first + 0.00000001) {
        cx = d[2].second.x;
        cy = d[2].second.y;
        r = d[2].first / 2;
    }
    else {
        std::tie(cx, cy, r) = circle_center(a, b, c);
    }
 
    REP(i, q) {
        xy t;
        cin >> t.x >> t.y;
        if (len(t, xy{ cx, cy }) < r + 0.0000001) {
			cout << "Yes" << endl;
		}
        else {
			cout << "No" << endl;
		}
    }
}