#pragma GCC optimize ("O3,inline,omit-frame-pointer,no-asynchronous-unwind-tables,fast-math")
#include <bits/stdc++.h>
#include <unordered_map>
#include <stdlib.h>
using namespace std;
#define rep(i, a, n) for(ll i = a; i < n; i++)
#define rrep(i, a, n) for(ll i = a; i >= n; i--)
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
//constexpr ll MOD = 1000000007;
constexpr ll MOD = 998244353;
constexpr int IINF = 1001001001;
constexpr ll INF = 1LL<<60;
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}
 


int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    ll n; cin >> n;
    unordered_map<ll,ll> mp;
    vector<tuple<ll,ll,ll>> event;
    rep(i,0,n){
        ll a, b; cin >> a >> b;
        event.push_back({a,-INF,b});
    }
    ll q; cin >> q;
    vector<ll> ans(q);
    rep(i,0,q){
        ll x, y; cin >> x >> y;
        event.push_back({x,y,i});
    }
    sort(event.begin(), event.end());
    ll cnt = 0;
    for(auto [a,b,c]: event){
        if(b == -INF){
            cnt++;
            mp[c]++;
        }else{
            ans[c] = cnt-mp[b];
        }
    }
    for(auto x: ans) cout << x << endl;
    return 0;
}