#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
//#define ll long long
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
#define rep(i, n) REP(i, 0, n)
#define rep_rev(i, n) for (int (i) = (int)(n) - 1 ; (i) >= 0 ; --(i))
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for(int i = x; i < n; i++)
#define all(x) (x).begin(),(x).end()
ll t1,t2;
const ll mod = 1000000007;
const int INF = 1e9;
const ll INFLONG = 1e18;
void swap(ll *x,ll *y){
  ll tmp;
  tmp = *x;
  *x = *y;
  *y = tmp;
}

#define EPS (1e-10)
#define equals(a,b) (fabs((a) - (b)) < EPS)
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;


class Point {
public:
    double x,y;
    Point(double x,double y):x(x),y(y){}
    Point():x(0),y(0){}

    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);}

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

    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;
    }

    void set(double x,double y) {
      this->x = x;
      this->y = y;
    }

    void rotateR(){
      double xt = x;
      double yt = y;
      x = yt;
      y = -xt;
    }
    void rotateL(){
      double xt = x;
      double yt = y;
      x = -yt;
      y = xt;
    }
};

struct Segment{
    Point p1,p2;
};

class Circle{
public:
    Point c;
    double r;
    Circle(Point c = Point(),double r = 0.0):c(c),r(r){}
};



typedef Point Vector;
typedef Segment Line;
typedef vector<Point> Polygon;

double norm(Point a){
  return a.x * a.x + a.y * a.y;
}

double abs(Point a){
  return sqrt(norm(a));
}

//等しいか
bool eq(Point a,Point b){
  return abs(a-b) < EPS;
}

//内積
double dot(Vector a, Vector b){
  return a.x * b.x + a.y * b.y;
}

//外積
double cross(Vector a,Vector b){
  return a.x * b.y - a.y * b.x;
}

//直交か
bool isOrthogonal(Vector a,Vector b){
  return equals(dot(a,b),0.0);
}

bool isOrthogonal(Point a1,Point a2,Point b1,Point b2){
  return isOrthogonal(a1-a2,b1-b2);
}

bool isOrthogonal(Segment s1,Segment s2){
  return equals(dot(s1.p2 - s1.p1,s2.p2-s2.p1),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 isParallel(a1-a2,b1-b2);
}

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

//射影
Point project(Segment s,Point p){
  Point vec1,vec2;
  vec1 = s.p2 - s.p1;
  vec2 = p - s.p1;
  return s.p1 + vec1 * dot(vec1,vec2) / vec1.norm();
}

//反射
Point reflect(Segment s,Point p){
  return p + (project(s,p) - p)* 2;
}

//位置関係(時計回りか,線分上かなど)
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(a.norm() < b.norm())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(Point a,Point b){
  return abs(a-b);
}

// Line : Point
double getDistanceLP(Line l,Point p){
  return abs((cross(l.p2 - l.p1,p - l.p1) / abs(l.p2 - l.p1)));
}

// Segment : Point
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);
}


double getDistance(Segment s1,Segment s2){
  if(intersect(s1,s2)){
    return 0.0;
  }
  double ans = INF;
  chmin(ans,getDistanceSP(s1,s2.p1));
  chmin(ans,getDistanceSP(s1,s2.p2));
  chmin(ans,getDistanceSP(s2,s1.p1));
  chmin(ans,getDistanceSP(s2,s1.p2));
  return ans;
}

//交わるか
bool intersect(Circle c,Line l){
  return c.r - getDistanceLP(l,c.c) > -EPS;
}

//円と直線の交点
pair<Point,Point> getCrossPoint(Line l,Circle c){
  assert(intersect(c,l));
  Vector pr = project(l,c.c);
  Vector e = (l.p2 - l.p1) / abs(l.p2 - l.p1);
  if(e.x < 0 || (e.x < EPS && e.y < 0)){
    e = e * -1;
  }
  double base = sqrt(c.r * c.r - norm(pr - c.c));
  return make_pair(pr - e * base,pr + e * base);
}

//交わるか
bool intersect(Circle c1,Circle c2){
  double dis = getDistance(c1.c,c2.c);
  return c1.r + c2.r - dis > -EPS && abs(c1.r - c2.r) - dis < EPS;
}

//atan
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> getCrossPoint(Circle c1,Circle c2){
  assert(intersect(c1,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);
  //cout << d << a << t;
  return make_pair(c1.c + polar(c1.r, t+a), c1.c + polar(c1.r,t-a));
}

//内包
// IN:2,ON:1,OUT:0
int contains(Polygon g,Point p){
  ull n = g.size();
  bool x = false;
  rep(i,n){
    Point a = g[i] - p;
    Point 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; //3つ目の条件は、時計回りか半時計回りか
  }
  return (x ? 2 : 0);
}

int main() {
  ll g,n;
  double x,y;
  cin >> g;
  Polygon po(g);
  rep(i,g){
    cin >> x >> y;
    po[i] = Point(x,y);
  }
  cin >> n;
  vector<Point> p(n);
  rep(i,n){
    cin >> x >> y;
    p[i] = Point(x,y);
  }
  rep(i,n){
    cout << contains(po,p[i]) << endl;
  }
}



Measured memory_bytes: 3236