#include <bits/stdc++.h>
using namespace std;
int n, x[100005], y[100005];
long long ccw(int o, int a, int b) {
  long long val =
      1ll * (x[a] - x[o]) * (y[b] - y[o]) - 1ll * (x[b] - x[o]) * (y[a] - y[o]);
  return val;
}
int main() {
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d %d", &x[i], &y[i]);
  long long area = 0;
  for (int i = 0; i < n; i++) area -= ccw(0, i, (i + 1) % n);
  int test;
  scanf("%d", &test);
  while (test--) {
    scanf("%d %d", &x[n], &y[n]);
    long long area__ = 0;
    for (int i = 0; i < n; i++) {
      area__ += abs(ccw(n, i, (i + 1) % n));
    }
    if (area != area__) {
      printf("0\n");
      continue;
    }
    long long ans = 0;
    int i = 0, j = 1;
    for (; i < n; i++) {
      for (;; j = (j + 1) % n)
        if (ccw(i, n, j) <= 0) break;
      ans += 1ll * ((j - i - 2 + 2 * n) % n) * ((j - i - 1 + n) % n) / 2;
    }
    printf("%lld\n", 1ll * n * (n - 1) * (n - 2) / 6 - ans);
  }
}
