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

int main(){
    int N,Q;
    cin >> N;
    vector<pair<int,int>> A(N);
    for(int i = 0; i < N; i++){
        cin >> A[i].first >> A[i].second;
    }
    sort(A.begin(),A.end());
    vector c(100001,vector<int>(0));
    for(int i = 0; i < N; i++){
        c[A[i].second].push_back(A[i].first);
    }
    
    cin >> Q;
    for(int i = 0; i < Q; i++){
        int X,Y;
        cin >> X >> Y;
        int ok = -1, ng = N;
        while(abs(ok - ng) > 1){
            int mid = (ok + ng) / 2;
            if(A[mid].first <= X)ok = mid;
            else ng = mid;
        }
        int ans = ok + 1;
        ok = -1, ng = c[Y].size();
        while(abs(ok - ng) > 1){
            int mid = (ok + ng) / 2;
            if(c[Y][mid] <= X)ok = mid;
            else ng = mid;
        }
        ans -= ok + 1;
        cout << ans << endl;
    }
    return 0;
}