#include <bits/stdc++.h>
using namespace std;

int main(){
    int n; cin >> n;
    vector<int> a (n);
    unordered_map<int, vector<int>> ab;
    // vector<int> b (n);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
        int b; cin >> b;
        ab[b].push_back(a[i]);
    }
    sort(a.begin(), a.end());
    
    for (auto x : ab) {
        sort(ab[x.first].begin(), ab[x.first].end());
    }
    int q; cin >> q;
    vector<int> x (q);
    vector<int> y (q);
    for (int i = 0; i < q; i++) {
        cin >> x[i] >> y[i];
        int aptr = upper_bound(a.begin(), a.end(), x[i]) - a.begin();
        int bptr = upper_bound(ab[y[i]].begin(), ab[y[i]].end(), x[i]) - ab[y[i]].begin();
        cout << aptr - bptr << endl;
    }

}