#include <stdio.h>
#include <string.h>
#include <math.h>
int n,q;
int cir[510][510];
int max(int a,int b)
{
    return a>b?a:b;
}
int min(int a,int b)
{
    return a<b?a:b;
}
int calc(int xa,int ya,int xb,int yb)
{
    int i,j,l,r,ret = 0;
    int a = yb-ya,b = xa-xb,c = (xb-xa)*ya-(yb-ya)*xa;
    double d,k = 1.0*(yb-ya)/(xb-xa);
    if(ya == yb)
    {
        for(i=xa;i<=xb;i++) ret += (cir[i][ya]>0);
        return ret;
    }
    if(xa == xb)
    {
        if(ya<yb) for(i=ya;i<=yb;i++) ret += (cir[xa][i]>0);
        else for(i=yb;i<=ya;i++) ret += (cir[xa][i]>0);
        return ret;
    }
     
    for(i=xa;i<=xb;i++)
    {
        l = min((int)floor(k*(i-1-xa)+ya), (int)floor(k*(i+1-xa)+ya));
        r = max((int)ceil(k*(i-1-xa)+ya), (int)ceil(k*(i+1-xa)+ya));
        l = max(l,min(ya,yb)); r = min(r,max(ya,yb));
        for(j=l;j<=r;j++)
        {
            d = 1.0*fabs((a*i+b*j+c)*(a*i+b*j+c))/(a*a+b*b);
            ret += (cir[i][j]>d*100);
        }
    }
    return ret;
}
int main()
{
    int i,j,k,x,y,r;
    int xa,ya,xb,yb;
    while(scanf("%d",&n)>0)
    {
        memset(cir,0,sizeof(cir));
        for(i=1;i<=n;i++)
        {
            scanf("%d %d 0.%d",&x,&y,&r);
            cir[x][y] = r*r;
        }
         
        scanf("%d",&q);
        while(q--)
        {
            scanf("%d%d%d%d",&xa,&ya,&xb,&yb);
            if(xa<xb) printf("%d\n",calc(xa,ya,xb,yb));
            else printf("%d\n",calc(xb,yb,xa,ya));
        }
    }
    return 0;
}