#include <bits/stdc++.h>

// #ifndef ONLINE_JUDGE
//     #include "debug/debug_template.cpp"
// #else
//     #define debug(...)
//     #define debugArr(...)
// #endif

#define ll long long
#define nl "\n"
#define vi vector<int>
#define vvi vector<vector<int>>
#define int long long
#define pii pair<int,int>
#define double long double
#define pb push_back
#define here cout<<"HERE"<<nl;
#define forn(i,a,n) for(int i = a; i < n; i++)
#define print(a) for(auto& e : a) cout << e << " "; cout << nl;
#define all(a) a.begin(),a.end()
#define MOD(a,b) ((a%b)+b)%b
#define yesno(b) cout << ((b)? "YES\n" : "NO\n")
template<typename T> using min_heap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
using namespace std;
void solve() {
    int n;
    cin >> n;
    vector<pii> probs(n);
    forn(i, 0 , n){
        int a, b;
        cin >> a >> b;
        probs[i] = {a, b};
    }

    sort(all(probs));
    vi diffs;
    for(auto [u, v] : probs) diffs.push_back(u);

    map<int, vi> topic;
    for(auto &[u, v] : probs) topic[v].push_back(u);

    for(auto &[u, v] : topic) sort(all(v));

    int q;
    cin >> q;
    while(q--){
        int x, y;
        cin >> x >> y;

        int ez = upper_bound(all(diffs), x) - diffs.begin();

        int bad = 0;
        if(topic.count(y))
            bad = upper_bound(all(topic[y]), x) - topic[y].begin();

        cout << ez - bad << nl;
    }
}
signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    //cin >> t;
    while (t--){
        solve();
    }
    return 0;
}