#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

inline ll read()

{

    ll s=; bool f=; char ch=' ';

    while(!isdigit(ch)) {f|=(ch=='-'); ch=getchar();}

    while(isdigit(ch)) {s=(s<<)+(s<<)+(ch^); ch=getchar();}

    return (f)?(-s):(s);

}

#define R(x) x=read()

inline void write(ll x)

{

    if(x<) {putchar('-'); x=-x;}

    if(x<) {putchar(x+''); return;}

    write(x/); putchar((x%)+'');

}

#define W(x) write(x),putchar(' ')

#define Wl(x) write(x),putchar('\n')

const ll Base=;

const int N=;

int n,nn,m,Q;

struct Node

{

    ll x,y;

    inline bool operator==(const Node &tmp)const

    {

        return x*tmp.y==y*tmp.x;

    }

}a[];

inline bool cmp(Node p,Node q)

{

    if(p.y*q.y<) return (p.x*q.y<p.y*q.x);

    else return (p.x*q.y>p.y*q.x);

}

map<ll,int>Zer,Map[N];

int main()

{

    freopen("laser.in","r",stdin);

    freopen("laser.out","w",stdout);

    int i,j,x,y;

    R(n);

    for(i=;i<=n;i++)

    {

        R(a[i].x); R(a[i].y);

    }

    sort(a+,a+n+,cmp);

    nn=unique(a+,a+n+)-a-;

    R(m);

    for(i=;i<=m;i++)

    {

        R(x); R(y);

        Zer[x*Base+y]++;

        for(j=;j<=nn;j++)

        {

            Map[j][x*a[j].y-y*a[j].x]++;

        }

    }

    R(Q);

    while(Q--)

    {

        R(x); R(y);

        int ans=;

        ans-=Zer[x*Base+y]*(nn-);

        for(i=;i<=nn;i++) ans+=Map[i][x*a[i].y-y*a[i].x];

        Wl(ans);

    }

    return ;

}