#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

const int N = 16001;

struct Punct{
    int x, y;
};

class Aib{
    short int* aib[N];
    int size;

    inline int step(int x){
        return x & -x;
    }

    int find(short int* v, int x){
        int ans = 0;
        for (int step = 1 << ( 31 - __builtin_clz( v[0] ) ) ; step ; step >>= 1)
            if ( (ans ^ step) <= v[0] && v[ans ^ step] <= x )
                ans ^= step;
        return ans;
    }

    inline void add(short int* v, int x){
        v[ ++v[0] ] = x;
    }

public:
    void init(int n, int* cnt){
        size = n;

        for (int i = 1 ; i <= n ; i++){
            cnt[ i + step(i) ] += cnt[i];

            aib[i] = (short int*) malloc( (1 + cnt[i]) * sizeof(short int) );
            aib[i][0] = 0;
        }
    }

    void insert(int x, int y){
        for (int i = x ; i <= size ; i += step(i))
            add( aib[i], y );
    }

    int query(int x, int y){
        int ans = 0;
        for (int i = x ; i ; i -= step(i))
            ans += find(aib[i], y);
        return ans;
    }

    int query(int x, int y, int z, int t){
        return query(z, t) - query(z, y) - query(x, t) + query(x, y);
    }

    void pregen(){
        for (int i = 1 ; i <= size ; i++)
            sort( aib[i] + 1, aib[i] + aib[i][0] + 1 );
    }
};

int X[N], Y[N], cnt[N], n;
Punct P[N];
Aib A;

ifstream in("zoo.in");
ofstream out("zoo.out");

void cleanup(int v[], int n){
    v[0] = 1;
    for (int i = 2 ; i <= n ; i++)
        if ( v[i] != v[i - 1] )
            v[ ++v[0] ] = v[i];
}

int norm(int v[], int x){
    int ans = 0;
    for (int step = 1 << (31 - __builtin_clz( v[0] ) ) ; step ; step >>= 1)
        if ( (ans ^ step) <= v[0] && v[ans ^ step] <= x )
            ans ^= step;
    return ans;
}

int main(){
    int x, y, z, t, nrQ;

    in >> n;
    for (int i = 1 ; i <= n ; i++){
        in >> P[i].x >> P[i].y;
        X[i] = P[i].x;
        Y[i] = P[i].y;
    }

    cleanup(X, n);
    cleanup(Y, n);

    for (int i = 1 ; i <= n ; i++)
        cnt[ norm(Y, P[i].y) ]++;

    A.init(X[0], cnt);
    for (int i = 1 ; i <= n ; i++)
        A.insert( norm(X, P[i].x), norm(Y, P[i].y) );
    A.pregen();

    in >> nrQ;
    while (nrQ--){
        in >> x >> y >> z >> t; x--; y--;
        out << A.query( norm(X, x), norm(Y, y), norm(X, z), norm(Y, t) ) << "\n";
    }

    return 0;
}