Problem: You are given a convex polygon. Count, please, the number of triangles that contain a given point in the plane and their vertices are the vertices of the polygon. It is guaranteed, that the point doesn't lie on the sides and the diagonals of the polygon.

Input

The first line contains integer n — the number of vertices of the polygon (3 ≤ n ≤ 100000). The polygon description is following: n lines containing coordinates of the vertices in clockwise order (integer x and y not greater than 109 by absolute value). It is guaranteed that the given polygon is nondegenerate and convex (no three points lie on the same line).

The next line contains integer t (1 ≤ t ≤ 20) — the number of points which you should count the answer for. It is followed by t lines with coordinates of the points (integer x and y not greater than 109 by absolute value).

Output

The output should contain t integer numbers, each on a separate line, where i-th number is the answer for the i-th point.

Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cin (also you may use %I64d).

Examples

Input

4
5 0
0 0
0 5
5 5
1
1 3


Output

2


Input

3
0 0
0 5
5 0
2
1 1
10 10


Output

1
0


Input

5
7 6
6 3
4 1
1 2
2 4
4
3 3
2 3
5 5
4 2


Output

5
3
3
4

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxn = 100010;
struct point {
  int x, y;
};
int n, m;
point data[maxn], ori;
long long area = 0;
void input() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d%d", &data[i].x, &data[i].y);
}
long long mul(point O, point A, point B) {
  A.x -= O.x, A.y -= O.y;
  B.x -= O.x, B.y -= O.y;
  return (long long)A.x * B.y - (long long)A.y * B.x;
}
long long caln() {
  long long cnt = abs(mul(ori, data[1], data[n]));
  for (int i = 1; i + 1 <= n; i++) {
    cnt += abs(mul(ori, data[i], data[i + 1]));
    if (cnt > area) return 0;
  }
  if (cnt != area) return 0;
  long long ret = (long long)n * (n - 1) * (n - 2) / 6;
  for (int i = 1, j = 1; i <= n; i++) {
    while (j + 1 != i + n && mul(data[i], ori, data[j % n + 1]) > 0) j++;
    ret -= (long long)(j - i) * (j - i - 1) / 2;
  }
  return ret;
}
void solve() {
  for (int i = 2; i + 1 <= n; i++)
    area += abs(mul(data[1], data[i], data[i + 1]));
  scanf("%d", &m);
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &ori.x, &ori.y);
    cout << caln() << endl;
  }
}
int main() {
  input();
  solve();
  return 0;
}