#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto& i:a)
#define ff first 
#define ss second 
#define all(a) begin(a),end(a)
#define allr(a) rbegin(a),rend(a)
#define pb push_back
using namespace std;
using ll =long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vll=vector<ll>;
template<class T> inline bool chmin(T& a,T b){return a>b?a=b,1:0;}
template<class T> inline bool chmax(T& a,T b){return a<b?a=b,1:0;}

int n,q;
vll a,b;
vll x,y;
template<class T> inline int ub(vector<T> &v,T c){return distance(begin(v),upper_bound(all(v),c));}
int main(){
    //cin.tie(0)->sync_with_stdio(0);
    int MAXB=200000;
    cin>>n;a.resize(n);b.resize(n);
    rep(i,0,n){
        cin>>a[i]>>b[i];
    }
    cin>>q;x.resize(q);y.resize(q);
    rep(i,0,q){
        cin>>x[i]>>y[i];
    }
    vector<ll> v;
    vector<vector<ll>> g(MAXB);
    rep(i,0,n){
        v.pb(a[i]);
        g[b[i]].pb(a[i]);
    }
    sort(all(v));
    rep(i,0,MAXB){
        sort(all(g[i]));
    }
    rep(i,0,q){
        cout<<ub(v,x[i])-ub(g[y[i]],x[i])<<'\n';   
    }


    return 0;
}
/*

*/