#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
#define mod 1000000007
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cout.tie(0);
    int N,Q;
    pair<ll,ll> AB[20009];
    ll X[20009],Y[20009];
    cin>>N;
    for(int i=1;i<=N;i++) cin>>AB[i].first>>AB[i].second;
    sort(AB+1,AB+N+1);
    cin>>Q;
    map<int,int>now;
    map<int,int>data[2009];////////////////////////
    for(int i=1;i<=N;i++) now[AB[i].second]=0;
    for(int i=1;i<=N;i++){
        now[AB[i].second]++;
        data[i]=now;
    }
    for(int i=1;i<=Q;i++){
        cin>>X[i]>>Y[i];
        auto iter=lower_bound(AB+1,AB+N+1,make_pair(X[i]+1,0LL));
        int idx=distance(AB+1,iter);
        idx-=data[idx][Y[i]];
        cout<<idx<<endl;
    }
}