#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define int long long #define ii pair #define app push_back #define all(a) a.begin(), a.end() #define bp __builtin_popcountll #define ll long long #define mp make_pair #define x first #define y second #define Time (double)clock()/CLOCKS_PER_SEC #define munq(a) sort(all(a)); a.resize(unique(all(a))-a.begin()) #define sz(a) ((int)a.size()) #ifdef LOCAL #define debug(x) do { cout << #x << ": " << x << endl; } while(0) #define debug2(x, y) do { std::cerr << #x << ", " << #y << ": " << x << ", " << y << endl; } while (0) #define debug3(x, y, z) do {std::cerr << #x << ", " << #y << ", " << #z << ": " << x << ", " << y << ", " << z << endl; } while(0) #else #define debug(x) #define debug2(x, y) #define debug3(x, y, z) #endif #define FORI(i,a,b) for (int i = (a); i < (b); ++i) #define FOR(i,a) FORI(i,0,a) #define ROFI(i,a,b) for (int i = (b)-1; i >= (a); --i) #define ROF(i,a) ROFI(i,0,a) #define rep(a) FOR(_,a) #define each(a,x) for (auto& a: x) #define FORN(i, n) FORI(i, 1, n + 1) #define ld long double using vi = vector; template std::istream& operator >>(std::istream& input, std::pair & data) { input >> data.x >> data.y; return input; } template std::istream& operator >>(std::istream& input, std::vector& data) { for (T& x : data) input >> x; return input; } template std::ostream& operator <<(std::ostream& output, const pair & data) { output << "(" << data.x << "," << data.y << ")"; return output; } template std::ostream& operator <<(std::ostream& output, const std::vector& data) { for (const T& x : data) output << x << " "; return output; } ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down ll math_mod(ll a, ll b) { return a - b * div_down(a, b); } #define tcT template using V = vector; tcT> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } // set a = min(a,b) tcT> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } tcT> vector presum(vector &a) { vector p(a.size() + 1); FOR (i, a.size()) { p[i + 1] = p[i] + a[i]; } return p; } tcT> vector sufsum(vector &a) { vector p(a.size() + 1); for (int i = (int)a.size() - 1; i >= 0; --i) { p[i] = p[i + 1] + a[i]; } return p; } ll gcd(ll a, ll b) { while (b) { tie(a, b) = mp(b, a % b); } return a; } int Bit(int mask, int bit) { return (mask >> bit) & 1; } #define double long double const int mod=(1LL<<31)-1; const int cn=233811181; // intersect two lines struct point { int x, y; point() { } point(int x,int y) { this->x=x;this->y=y; } friend ll scalar(point p, point q) { return p.x * 1LL * q.x + p.y * 1LL * q.y; } friend ll cross(point p, point q) { return p.x * 1LL * q.y - p.y * 1LL * q.x; } friend istream &operator>>(istream &is, point &p) { is >> p.x >> p.y; return is; } }; template T sqr(T t) { return t * t; } struct line { double a, b; double c; line(double x, double y, double a, double b) : a(a), b(b), c(-a * x - b * y) {} }; const double eps = 1e-9; struct circle { double x, y, r; circle(){} circle(point a, point b) : x((a.x + b.x) / 2.0), y((a.y + b.y) / 2.0), r(sqrt(sqr(x - a.x) + sqr(y - a.y))) {} circle(point a, point b, point c) { line l1 = line((a.x + b.x) / 2.0, (a.y + b.y) / 2.0, b.x - a.x, b.y - a.y); line l2 = line((a.x + c.x) / 2.0, (a.y + c.y) / 2.0, c.x - a.x, c.y - a.y); x = (l1.c * l2.b - l2.c * l1.b) / (l1.b * l2.a - l2.b * l1.a); y = (l2.c * l1.a - l1.c * l2.a) / (l1.b * l2.a - l2.b * l1.a); r = sqrt(sqr(x - a.x) + sqr(y - a.y)); } friend ostream &operator<<(ostream &os, const circle &c) { os << c.x << ' ' << c.y << '\n' << c.r << '\n'; return os; } bool contains(point p) const { return sqr(p.x - x) + sqr(p.y - y) <= sqr(r) + eps; } }; const int maxn=2005; circle mem[maxn]; circle minDisk2(const vector &wasps, int j, int i) { circle ans(wasps[i], wasps[j]); for (int k = 0; k < j; ++k) { if (ans.contains(wasps[k])) continue; ans = circle(wasps[k], wasps[j], wasps[i]); } return ans; } circle minDisk1(const vector &wasps, int i) { circle ans(wasps[0], wasps[i]); for (int j = 1; j < i; ++j) { if (ans.contains(wasps[j])) continue; ans = minDisk2(wasps, j, i); } return ans; } circle minDisk0(const vector &wasps) { circle ans(wasps[0], wasps[0]); mem[0]=ans; for (int i = 1; i < wasps.size(); ++i) { if (ans.contains(wasps[i])) {mem[i]=ans;continue;} ans = minDisk1(wasps, i); mem[i]=ans; } return ans; } signed main() { #ifdef LOCAL #else #define endl '\n' ios_base::sync_with_stdio(0); cin.tie(0); #endif int n; cin >> n; point A, B, C; cin >> A.x >> A.y >> B.x >> B.y >> C.x >> C.y; V v = {A, B, C}; circle c = minDisk0(v); //cout << c.x << ' ' << c.y << endl; rep (n) { point p;cin >> p.x >> p.y; if (c.contains(p)) { cout << "Yes" << endl; } else { cout<<"No" << endl; } } }