#include<cmath>

#include<cstdio>

#include<bitset>

#include<algorithm>

#define N 40000

#define eps 1e-8

using namespace std;

int i,j,k,n,m,x,y,t;

struct data{double x1,x2,x3,x4;int id,p;}p[N],q[N],pq[N+N];

bitset<N> ans[N],w;

bool same(double a,double b){return fabs(a-b)<eps;}

bool cmp1(const data&a,const data&b){return same(a.x1,b.x1)?a.p>b.p:a.x1<b.x1-eps;}

bool cmp2(const data&a,const data&b){return same(a.x2,b.x2)?a.p>b.p:a.x2<b.x2-eps;}

bool cmp3(const data&a,const data&b){return same(a.x3,b.x3)?a.p>b.p:a.x3<b.x3-eps;}

bool cmp4(const data&a,const data&b){return same(a.x4,b.x4)?a.p>b.p:a.x4<b.x4-eps;}

int main(){

    scanf("%d",&n);

    for (i=;i<=n;i++){scanf("%lf%lf%lf%lf",&p[i].x1,&p[i].x2,&p[i].x3,&p[i].x4);p[i].id=i;p[i].p=;}

    scanf("%d",&m);

    for (i=;i<=m;i++){scanf("%lf%lf%lf%lf",&q[i].x1,&q[i].x2,&q[i].x3,&q[i].x4);q[i].id=i;q[i].p=;}

    for (i=;i<=m;i++)ans[i].set();

    //-----------------------------------------------------------------

    for (i=;i<=n;i++)pq[i]=p[i];

    for (i=;i<=m;i++)pq[n+i]=q[i];

    sort(pq+,pq++n+m,cmp1);

    w.reset();

    for (i=;i<=n+m;i++)if (pq[i].p)w[pq[i].id]=;else ans[pq[i].id]&=w;

    //-----------------------------------------------------------------

    for (i=;i<=n;i++)pq[i]=p[i];

    for (i=;i<=m;i++)pq[n+i]=q[i];

    sort(pq+,pq++n+m,cmp2);

    w.reset();

    for (i=;i<=n+m;i++)if (pq[i].p)w[pq[i].id]=;else ans[pq[i].id]&=w;

    //-----------------------------------------------------------------

    for (i=;i<=n;i++)pq[i]=p[i];

    for (i=;i<=m;i++)pq[n+i]=q[i];

    sort(pq+,pq++n+m,cmp3);

    w.reset();

    for (i=;i<=n+m;i++)if (pq[i].p)w[pq[i].id]=;else ans[pq[i].id]&=w;

    //-----------------------------------------------------------------

    for (i=;i<=n;i++)pq[i]=p[i];

    for (i=;i<=m;i++)pq[n+i]=q[i];

    sort(pq+,pq++n+m,cmp4);

    w.reset();

    for (i=;i<=n+m;i++)if (pq[i].p)w[pq[i].id]=;else ans[pq[i].id]&=w;

    for (i=;i<=m;i++)printf("%d\n",ans[i].count());

    return ;

}