/*************************************************************************
    > File Name:            hdu_1756.cpp
    > Author:               Howe_Young
    > Mail:                 1013410795@qq.com
    > Created Time:         2015年04月06日 星期一 09时06分42秒
 ************************************************************************/

#include <cstdio>
#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdlib>
#include <algorithm>
#include <cstdio>
#define EPS 1e-8
using namespace std;
typedef long long LL;
const int N = 105;
struct point{
    double x, y;
};
point poly[N];
int n, m;
double dabs(double a)
{
    return a < 0 ? -a : a;
}
double Min(double a, double b)
{
    return a < b ? a : b;
}
double Max(double a, double b)
{
    return a > b ? a : b;
}

bool on_line(point a, point b, point c)//判断点在直线上
{
    if (c.x >= Min(a.x, b.x) && c.x <= Max(a.x, b.x) && c.y >= Min(a.y, b.y) && c.y <= Max(a.y, b.y))
    {
        return (dabs((c.x - a.x) * (b.y - a.y) - (b.x - a.x) * (c.y - a.y)) <= EPS);
    }
    return false;
}
bool inside_polygon(point p, int n)//判断点在多边形内
{
    int counter = 0;
    double xinter;
    point p1, p2;
    p1 = poly[0];
    for (int i = 1; i <= n; i++)
    {
        p2 = poly[i % n];
        if (on_line(p1, p2, p))//此题在边界不算
            return false;
        if (p.y > Min(p1.y, p2.y))//如果射线交于边的下端点,不算相交,所以是>
        {
            if (p.y <= Max(p1.y, p2.y))
            {
                if (p.x <= Max(p1.x, p2.x))
                {
                    if (p1.y != p2.y)//如果射线和边重合,不算
                    {
                        //判断是否满足在这个边的左边,其中(p1.x - p2.x) / (p1.y - p2.y)为tan
                        xinter = (p.y - p2.y) * (p1.x - p2.x) / (p1.y - p2.y) + p2.x;
                        if (p1.x == p2.x || p.x <= xinter)
                            counter++;
                    }
                }
            }
        }
        p1 = p2;
    }
    if (counter % 2 == 0)
        return false;
    return true;
}
int main()
{
    while (~scanf("%d", &n))
    {
        for (int i = 0; i < n; i++)
        {
            scanf("%lf %lf", &poly[i].x, &poly[i].y);
        }
        cin >> m;
        point p;
        for (int i = 0; i < m; i++)
        {
            cin >> p.x >> p.y;
            if (inside_polygon(p, n))
                puts("Yes");
            else
                puts("No");
        }
    }
    return 0;
}