#ifdef NACHIA
#define _GLIBCXX_DEBUG
#else
#define NDEBUG
#endif
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(i64 i=0; i<i64(n); i++)
const i64 INF = 1001001001001001001;
template<typename A> void chmin(A& l, const A& r){ if(r < l) l = r; }
template<typename A> void chmax(A& l, const A& r){ if(l < r) l = r; }
using namespace std;

i64 lbi(vector<i64>& a, i64 x){
    return lower_bound(a.begin(), a.end(), x) - a.begin();
}

void testcase(){
    i64 N; cin >> N;
    vector<i64> F;
    vector<vector<i64>> A(100001);
    rep(i,N){
        i64 a,b; cin >> a >> b;
        F.push_back(a);
        A[b].push_back(a);
    }
    sort(F.begin(), F.end());
    for(auto& f : A) sort(f.begin(), f.end());
    i64 Q; cin >> Q;
    rep(qi,Q){
        i64 x,y; cin >> x >> y;
        i64 ans = lbi(F,x+1) - lbi(A[y],x+1);
        cout << ans << "\n";
    }
}

int main(){
    ios::sync_with_stdio(false); cin.tie(nullptr);
    testcase();
    return 0;
}