#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>

using namespace std;

#define EPS (1e-10)

class Point {
public:
	int x, y;
	Point(int x, int y) :
			x(x), y(y) {
	}
	Point operator -(Point p) {
		return Point(x - p.x, y - p.y);
	}
};

typedef vector<Point> Polygon;

double dot(Point p1, Point p2) {
	return p1.x * p2.x + p1.y * p2.y;
}
double cross(Point p1, Point p2) {
	return p1.x * p2.y - p1.y * p2.x;
}
double norm(Point p) {
	return p.x * p.x + p.y * p.y;
}
double abs(Point p) {
	return sqrt(norm(p));
}

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 main() {

	int n;
	scanf("%d", &n);
	Polygon g;
	for (int i = 0; i < n; ++i) {
		int x, y;
		scanf("%d %d", &x, &y);
		Point p(x, y);
		g.push_back(p);
	}

	int q;
	scanf("%d", &q);
	for (int i = 0; i < q; ++i) {
		int x, y;
		scanf("%d %d", &x, &y);
		Point p(x, y);
		cout << contains(g, p) << endl;
	}
	return 0;
}