#include <fstream>
#include <vector>
#include <algorithm>
#define Nmax 16001
#define INF 2000000000
using namespace std;

int N,st,dr,M,x_1,y_1,x_2,y_2;
ifstream f("zoo.in");
ofstream g("zoo.out");
struct pct
{
    int x,y;
}points[Nmax];

vector<int> ARB[4*Nmax];
vector<int>::iterator it_left,it_right;

bool cmp(pct a,pct b)
{
    return (a.x < b.x);
}
void read_points()
{
    f>>N;
    for(int i=1;i<=N;++i)
        f>>points[i].x>>points[i].y;
}
void read_rect()
{
    f>>x_1>>y_1>>x_2>>y_2;
}
int bin_x_left(int x);
int bin_x_right(int x);
int bin_y_left(int nod, int x);
int bin_y_right(int nod, int x);
void init(int nod,int left,int right)
{
    if(left == right)
        ARB[nod].push_back(points[left].y);//bag in frunza y-ul de la x=left

    if(left>=right)
        return;

    int mid = (left+right)/2;
    init(nod*2,left,mid);
    init(nod*2+1,mid+1,right);

    it_left         = ARB[nod*2].begin();
    it_right        = ARB[nod*2+1].begin();

    for(;it_left != ARB[nod*2].end() && it_right != ARB[nod*2+1].end();)
    {
        if(*it_left <= *it_right)
        {
            ARB[nod].push_back(*it_left);
            ++it_left;
        }
        else
        {
            ARB[nod].push_back(*it_right);
            ++it_right;
        }
    }
    for(;it_left != ARB[nod*2].end();++it_left)
        ARB[nod].push_back(*it_left);
    for(;it_right != ARB[nod*2+1].end();++it_right)
        ARB[nod].push_back(*it_right);
}
int query(int nod,int left,int right)
{
    if(st<=left && right<=dr)
    {
        int pos1 = bin_y_left(nod,y_1);
        int pos2 = bin_y_right(nod,y_2);

        if(pos1 == -1 || pos2 == -1)//daca nu exista mai mari decat y1 sau mai mici decat y2 atunci e 0
            return 0;
        else
            return pos2 - pos1 + 1;
    }
    int mid = (left+right)/2,a=0,b=0;
    if(st<=mid)
        a = query(nod*2,left,mid);
    if(mid<dr)
        b = query(nod*2+1,mid+1,right);

    return a+b;
}
void solve()
{
    f>>M;
    int val;
    while(M--)
    {
        read_rect();

        st = bin_x_left(x_1);
        dr = bin_x_right(x_2);
        //printf("%d %d %d %d\n",x_1,x_2,st,dr);
        val = 0;
        if(st != -1 && dr != -1)
            val = query(1,1,N);

        g<<val<<"\n";
    }
}
int main()
{
    read_points();
    sort(points+1,points+N+1,cmp);
    init(1,1,N);

    solve();

    f.close();
    g.close();
    return 0;
}
int bin_x_left(int x)//caut cat mai apropiat si in stanga in points
{
    int step,i;

    if(points[N].x < x)
        return -1;

    for(step=1;step<=N;step <<= 1);
    for(i=N;step;step >>= 1)
        if(i-step >= 1 && points[i-step].x >= x)
            i-=step;

    return i;
}
int bin_x_right(int x)//caut cat mai apropiat si in dreapta in points
{
    int i,step;

    if(points[1].x > x)
        return -1;

    for(step=1;step<=N;step <<= 1);
    for(i=1;step;step >>= 1)
        if(i+step <= N && points[i+step].x <= x)
            i += step;

    return i;
}
int bin_y_left(int nod,int x)//caut cat mai in stanga(un elem i astfel incat v[i-1] < x && x<v[i]
{
    int i,step,size = ARB[nod].size();

    if(ARB[nod][size-1] < x)
        return -1;

    for(step=1;step < size;step <<= 1);

    for(i=size-1;step;step>>=1)
        if(i-step >= 0 && ARB[nod][i-step] >= x)
            i -= step;

    return i;
}
int bin_y_right(int nod,int x)//caut cat mai in dreapta
{
    int i,step,size = ARB[nod].size();

    if(ARB[nod][0] > x)
        return -1;

    for(step=1;step < size;step <<= 1);

    for(i=0;step;step>>=1)
        if(i + step < size && ARB[nod][i+step] <= x)
            i += step;

    return i;
}