#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;

int main() {
    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<multiset<long long>> cnt(100030);
    vector<long long> idxs;
    for (long long i = 0; i < n; ++i) {
        idxs.push_back(items[i].first);
        cnt[items[i].second].insert(items[i].first);
    }
    sort(idxs.begin(), idxs.end());
    
    long long q;
    cin >> q;
    for (long long i = 0; i < q; ++i) {
        long long x, y;
        cin >> x >> y;
        long long ans = upper_bound(idxs.begin(), idxs.end(), x) - idxs.begin() - distance(cnt[y].begin(), cnt[y].upper_bound(x));
        cout << ans << "\n";
    }
    return 0;
}