// BISMILLAH
// AUTHOR: KAMRAN
// Date: 2026-02-05 18:55

#include <bits/stdc++.h>
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());
  

    int m;
    cin>>m;
    while(m--){
        pair<int,int>y;
        cin>>y.first>>y.second;
        int cnt=0;
        vector<int>temp(n);
        for(int i=0;i<n;i++){
            if(x[i].second == y.second)cnt++;

            temp[i]=cnt;
        }


    int low=0;
    int high=n-1;
    while(low<=high){
        int mid=(low+high)/2;
        if(x[mid].first>y.first)high=mid-1;
        else low=mid+1;
    }
    if(low==0){
        cout<<0<<nl;
        continue;
    }else{
        low-=(temp[low-1]);
    }

    cout<<low<<nl;
    }


  

};

signed main() {
    fast;

// int t;
// cin>>t;

// while(t--)

solve();

    return 0;
}   

/*
2 2 3 5 10

5 50 500

*/