#include <bits/stdc++.h>
using namespace std;
const int maxn = 100000 + 10;
int x[maxn], y[maxn];
int n, t;
int det(int x1, int y1, int x2, int y2, int x3, int y3) {
  long long res =
      (long long)(x2 - x1) * (y3 - y1) - (long long)(x3 - x1) * (y2 - y1);
  if (!res) return 0;
  if (res > 0) return 1;
  return -1;
}
int main() {
  scanf("%d", &n);
  for (int i = n - 1; i >= 0; i--) scanf("%d%d", &x[i], &y[i]);
  for (scanf("%d", &t); t--;) {
    int x0, y0;
    scanf("%d%d", &x0, &y0);
    bool ok = 1;
    for (int i = 0; ok && i < n; i++) {
      int j = i + 1;
      if (j == n) j = 0;
      ok &= (det(x[i], y[i], x[j], y[j], x0, y0) >= 0);
    }
    if (!ok) {
      printf("0\n");
    } else {
      long long res = 0;
      for (int i = 0, j = 0; i < n; i++) {
        for (;;) {
          int jj = j + 1;
          if (jj == n) jj = 0;
          if (det(x[i], y[i], x[jj], y[jj], x0, y0) >= 0)
            j = jj;
          else
            break;
        }
        int cnt;
        if (j >= i)
          cnt = j - i + 1;
        else
          cnt = n - i + j + 1;
        if (cnt >= 3) res += (long long)(cnt - 1) * (cnt - 2) / 2;
        if (i == j) {
          j = (i + 1);
          if (j == n) j = 0;
        }
      }
      res = (long long)n * (n - 1) * (n - 2) / 6 - res;
      cout << res << endl;
    }
  }
}
