#include <bits/stdc++.h>
using namespace std;

using i64 = long long;

int main() {
    cin.tie(nullptr)->sync_with_stdio(false);

    auto solve = [&]() {
        int n;
        cin >> n;

        map<int, vector<int>> mp;

        for (int i = 0; i < n; i++) {
            int a, b;
            cin >> a >> b;
            mp[0].push_back(a);
            mp[b].push_back(a);
        }

        for (auto &[x, v] : mp) {
            sort(v.begin(), v.end());
        }

        int q;
        cin >> q;

        for (int i = 0; i < q; i++) {
            int x, y;
            cin >> x >> y;

            int ans = upper_bound(mp[0].begin(), mp[0].end(), x) - mp[0].begin();
            ans -= upper_bound(mp[y].begin(), mp[y].end(), x) - mp[y].begin();

            cout << ans << '\n';
        }
    };
    
    solve();
    
    return 0;
}