#include <iostream>
#include <utility>
#include <vector>
#include <cassert>

using namespace std;

const pair<int, int> INF{12345, 54321};

pair<int, int> operator-(const pair<int, int> &a, const pair<int, int> &b) {
	return {a.first - b.first, a.second - b.second};
}

long long operator*(const pair<int, int> &a, const pair<int, int> &b) {
	return a.first * b.second - a.second * b.first;
}

long long dot(const pair<int, int> &a, const pair<int, int> &b) {
	return a.first * b.first + a.second * b.second;
}

bool intersect(const pair<int, int> &a1, const pair<int, int> &a2, const pair<int, int> &b1, const pair<int, int> &b2) {
	auto diff = a2 - a1;
	auto cross1 = diff * (b1 - a1);
	auto cross2 = diff * (b2 - a1);
	return cross1 * cross2 < 0;
}

bool segintersect(const pair<int, int> &a1, const pair<int, int> &a2, const pair<int, int> &b1, const pair<int, int> &b2) {
	return intersect(a1, a2, b1, b2) && intersect(b1, b2, a1, a2);
}

long long mag2(const pair<int, int> &a) {
	return a.first * a.first + a.second * a.second;
}

bool colinear(const pair<int, int> &a, const pair<int, int> &b, const pair<int, int> &c) {
	return abs(dot(b - a, c - a)) * dot(b - a, c - a) == -mag2(b - a) * mag2(c - a);
}

int main() {
	int n, q;
	cin >> n;
	vector<pair<int, int>> polygon;
	for(int i = 0; i < n; i++) {
		int x, y;
		cin >> x >> y;
		polygon.emplace_back(x, y);
	}
	cin >> q;

	for(int j = 0; j < q; j++) {
		int x, y;
		cin >> x >> y;
		pair<int, int> p{x, y};

		bool iscolinear = false;
		int nintersects = 0;
		for(int i = 0; i < n; i++) {
			if(colinear(p, polygon[i], polygon[(i+1)%n])) {
				iscolinear = true;
			}
			else if (segintersect(p, INF, polygon[i], polygon[(i+1)%n])) {
				nintersects++;
			}
		}

		if(iscolinear) {
			cout << "1\n";
		}
		else {
			cout << ((nintersects % 2) * 2) << '\n';
		}
	}

	return 0;
}

