#include<bits/stdc++.h>
using namespace std;
#define EPS (1e-10)
#define equals(a, b) (fabs((a) - (b)) < EPS)

class Point{
public:
    double x, y;
    Point(){};
    Point(double x, double y):x(x), y(y){}
    Point operator + (Point p){return Point(x + p.x, y + p.y);}
    Point operator - (Point p){return Point(x - p.x, y - p.y);}
    Point operator * (double a){return Point(x * a, y * a);}
    Point operator / (double a){return Point(x / a, y / a);}
    bool operator < (const Point &p) const{
        return x != p.x ? x < p.x : y < p.y;
    }
    bool operator == (const Point &p) const {
        return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
    }
};

class Segment{
public:
    Point p1, p2;
    Segment(){};
    Segment(Point p1, Point p2):p1(p1), p2(p2){};
};

class Circle{
public:
    Point c;
    double r;
    Circle(){};
    Circle(Point c, double r):c(c), r(r){}
};
typedef Point Vector;
typedef Segment Line;
typedef vector<Point> Polygon;

double norm(Point p){return p.x * p.x + p.y * p.y;}
double abs(Point p){return sqrt(norm(p));};

double dot(Point a, Point b){
    return a.x * b.x + a.y * b.y;
}
double cross(Point a, Point b){
    return a.x * b.y - a.y * b.x;
}
bool isorthogonal(Vector a, Vector b){
    return equals(dot(a, b), 0.0);
}
bool isorthognoal(Point a1, Point a2, Point b1, Point b2){
    return equals(cross(a1 - a2, b1 - b2), 0.0);
}
bool isparallel(Vector a, Vector b){
    return equals(cross(a, b), 0.0);
}
bool isparallel(Point a1, Point a2, Point b1, Point b2){
    return equals(cross(a1 - a2, b1 - b2), 0.0);
}
Point project(Segment s, Point p){
    Vector base = s.p2 - s.p1;
    double r = dot(p - s.p1, base) / norm(base);
    return s.p1 + base * r;
}
Point reflect(Segment s, Point p){
    return p + (project(s, p) - p) * 2.0;
}
double getdistance(Point a, Point b){
    return abs(a - b);
}
double getdistancelp(Line l, Point p){
    return abs(cross(l.p2 - l.p1, p - l.p1) / abs(l.p2 - l.p1));
}
double getdistancesp(Segment s, Point p){
    if(dot(s.p2 - s.p1, p - s.p1) < 0.0)
        return abs(p - s.p1);
    if(dot(s.p1 - s.p2, p - s.p2) < 0.0)
        return abs(p - s.p2);
    return getdistancelp(s, p);
}

bool isorthogonal(Segment s1, Segment s2){
    return equals(dot(s1.p2  - s1.p1, s2.p2 - s1.p1), 0.0);
}
bool isparallel(Segment s1, Segment s2){
    return equals(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}

static const int counter_clockwise = 1;
static const int clockwise = -1;
static const int online_back = 2;
static const int online_front = -2;
static const int on_segment = 0;

int ccw(Point p0, Point p1, Point p2){
    Vector a = p1 - p0;
    Vector b = p2 - p0;
    if(cross(a, b) > EPS) return counter_clockwise;
    if(cross(a, b) < -EPS) return clockwise;
    if(dot(a,b) < -EPS) return online_back;
    if(norm(a) < norm(b)) return online_front;
    return on_segment;
}

bool intersect(Point p1, Point p2, Point p3, Point p4){
    return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
        ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
bool intersect(Segment s1, Segment s2){
    return intersect(s1.p1, s1.p2, s2.p1, s2.p2);
}
double getdistance(Segment s1, Segment s2){
    if(intersect(s1, s2))
        return 0.0;
    return min(min(getdistancesp(s1, s2.p1), getdistancesp(s1, s2.p2)),
        min(getdistancesp(s2, s1.p1), getdistancesp(s2, s1.p2)));
}

Point getcrosspoint(Segment s1, Segment s2){
    Vector base = s2.p2 - s2.p1;
    double d1 = abs(cross(base, s1.p1 - s2.p1));
    double d2 = abs(cross(base, s1.p2 - s2.p1));
    double t = d1 / (d1 + d2);
    return s1.p1 + (s1.p2 - s1.p1) * t;
}

pair<Point, Point>getcrosspoints(Circle c, Line l){
    Vector pr = project(l, c.c);
    Vector e = (l.p2 - l.p1) / abs(l.p2 - l.p1);
    double base = sqrt(c.r * c.r - norm(pr -c.c));
    return make_pair(pr + e * base, pr - e * base);
}

double arg(Vector p){return atan2(p.y, p.x);}
Vector polar(double a, double r){return Point(cos(r) * a, sin(r) * a);}

pair<Point, Point>getcrosspoints(Circle c1, Circle c2){
    double d = abs(c1.c - c2.c);
    double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));
    double t = arg(c2.c - c1.c);
    return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));
}

int contains(Polygon g, Point p){
    int n = g.size();
    bool x = false;
    for(int i = 0; i < n; i ++){
        Point a = g[i] - p, b = g[(i + 1) % n] - p;
        if(abs(cross(a, b)) < EPS && dot(a, b) < EPS) return 1;
        if(a.y > b.y)   swap(a, b);
        if(a.y < EPS && EPS < b.y && cross(a, b) > EPS)
            x = !x;
    }
    return (x ? 2 : 0);
}
int cmp(Point a, Point b){
    return (a.y < b.y || (a.y == b.y  && a.x < b.x));
}
Polygon andrewscan(Polygon s){
    Polygon u, l;
    int len = s.size();
    if(len < 3) return s;

    sort(s.begin(), s.end());
    u.push_back(s[0]);
    u.push_back(s[1]);
    l.push_back(s[len - 1]);
    l.push_back(s[len - 2]);

    for(int i = 2; i < len; i ++){
        for(int j = u.size(); j >= 2 && ccw(u[j - 2], u[j - 1], s[i]) >= 0; i --)
            u.pop_back();
        l.push_back(s[i]);
    }

    reverse(l.begin(), l.end());
    for(int i = u.size() - 2; i >= 1; i --)
        l.push_back(u[i]);

    return l;
}

int main(){
    int n, q, i;
    Polygon po;
    Point p, tp;
    scanf("%d", &n);
    for(i = 0; i < n; i ++){
        scanf("%lf %lf", &tp.x, &tp.y);
        po.push_back(tp);
    }
    scanf("%d", &q);
    for(i = 0; i < q; i ++){
        scanf("%lf %lf", &p.x, &p.y);
        printf("%d\n", contains(po, p));

    }
    return 0;
}



Measured memory_bytes: 3260