#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    long long n;
    cin >> n;
    vector<pair<long long, long long>> items(n);
    for (long long i = 0; i < n; ++i) {
        cin >> items[i].first >> items[i].second;
    }
    sort(items.begin(), items.end());

    vector<vector<long long>> cnt(100030);
    vector<long long> idxs(n);
    for (long long i = 0; i < n; ++i) {
        idxs[i] = items[i].first;
        cnt[items[i].second].push_back(items[i].first);
    }
	for (auto &v : cnt) {
        sort(v.begin(), v.end());
    }
    long long q;
    cin >> q;
    while (q--) {
        long long x, y;
        cin >> x >> y;
        long long total = upper_bound(idxs.begin(), idxs.end(), x) - idxs.begin();
        long long removed = upper_bound(cnt[y].begin(), cnt[y].end(), x) - cnt[y].begin();
        cout << total - removed << "\n";
    }

    return 0;
}