#include <bits/stdc++.h>
#define y1 yy1
#define norm normalizare
#define pii pair<int, int>
#define tiii tuple<int, int, int>
using namespace std;
const int NMAX = 16e3+2;
const int MMAX = 1e5+2;
const int VMAX = 1e6+2;
int n,m,sol[MMAX],aib[VMAX];
map<int, int> norm;
vector<int> events[VMAX];
vector<tiii> queries[VMAX];

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

struct Point{
    int x, y;
} p[NMAX], qst[MMAX], qdr[MMAX];

void update(int pos, int val){
    pos++;
    for(int i = pos; i < VMAX; i += (i&-i)){
        aib[i] += val;
    }
}

int query(int pos){
    pos++;
    int ans = 0;
    for(int i = pos; i > 0; i -= (i&-i)){
        ans += aib[i];
    }
    return ans;
}

int main()
{
    fin >> n;
    for(int i = 1; i <= n; i++){
        fin >> p[i].x >> p[i].y;
        norm[p[i].x] = norm[p[i].y] = i;
    }
    fin >> m;
    for(int i = 1; i <= m; i++){
        fin >> qst[i].x >> qst[i].y;
        fin >> qdr[i].x >> qdr[i].y;
        norm[qst[i].x] = norm[qst[i].y] = i;
        norm[qdr[i].x] = norm[qdr[i].y] = i;
    }
    int cnt = 0;
    for(auto &it: norm){
        it.second = ++cnt;
    }
    for(int i = 1; i <= n; i++){
        p[i].x = norm[p[i].x];
        p[i].y = norm[p[i].y];
        events[p[i].y].push_back(p[i].x);
    }
    for(int i = 1; i <= m; i++){
        qst[i].x = norm[qst[i].x];
        qst[i].y = norm[qst[i].y];
        qdr[i].x = norm[qdr[i].x];
        qdr[i].y = norm[qdr[i].y];

        queries[qdr[i].y].push_back({i, qdr[i].x, 1});
        queries[qst[i].y-1].push_back({i, qdr[i].x, -1});
        queries[qdr[i].y].push_back({i, qst[i].x-1, -1});
        queries[qst[i].y-1].push_back({i, qst[i].x-1, 1});
    }
    for(int i = 1; i < VMAX; i++){
        for(int it: events[i]){
            update(it, 1);
        }
        for(auto [idx, pos, coef]: queries[i]){
            sol[idx] += coef*query(pos);
        }
    }
    for(int i = 1; i <= m; i++){
        fout << sol[i] << "\n";
    }
    return 0;
}