#include <bits/stdc++.h>
using namespace std;
long long cross(pair<long long, long long> a, pair<long long, long long> b) {
  return a.first * b.second - a.second * b.first;
}
pair<long long, long long> operator-(pair<long long, long long> a,
                                     pair<long long, long long> b) {
  return pair<long long, long long>(a.first - b.first, a.second - b.second);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  vector<pair<long long, long long> > pts(n);
  for (int i = 0; i < int(n); ++i) cin >> pts[i].first >> pts[i].second;
  int t;
  cin >> t;
  while (t--) {
    bool inside = true;
    pair<long long, long long> pt;
    cin >> pt.first >> pt.second;
    for (int i = 0; i < n - 1; ++i) {
      inside = inside && cross(pts[i + 1] - pts[i], pt - pts[i]) <= 0;
    }
    if (!inside) {
      cout << 0 << endl;
      continue;
    }
    long long all = n * (n - 1) * (n - 2) / 6;
    long long cnt = 0;
    int j = 1;
    for (int i = 0; i < n; ++i) {
      while (cross(pts[j] - pts[i], pt - pts[i]) <= 0) {
        j = (j + 1) % n;
        assert(i != j);
      }
      long long x = (j - i + n) % n;
      cnt += (x - 1) * (x - 2) / 2;
    }
    cout << all - cnt << endl;
  }
  return 0;
}
