// BISMILLAH
// AUTHOR: KAMRAN
// Date: 2026-02-17 19:16

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

#define fast ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define  int long long
#define nl endl
 
void solve(){
    int n;
    cin>>n;
    vector<pair<int,int>>x(n);
    for(int i=0;i<n;i++){
        cin>>x[i].first>>x[i].second;
    }

    sort(x.begin(),x.end());
    map<int,vector<int>>y;
    for(int i=0;i<n;i++){
        y[x[i].second].push_back(x[i].first);
    }
    int m;
    cin>>m;
    while(m--){
        pair<int,int>z;
        cin>>z.first>>z.second;
        int total=upper_bound(x.begin(),x.end(),make_pair(z.first,LLONG_MAX))-x.begin();
        int temp=z.second;
        int ele=upper_bound(y[temp].begin(),y[temp].end(),z.first)-y[temp].begin();

        cout<<total-ele<<nl;
    }

};

signed main() {
    fast;

solve();

    return 0;
}