#include <iostream>
#include <vector>
#include <tuple>
#include <map>
#include <algorithm>

using namespace std;

int main() {
    int N;
    cin >> N;
    vector<tuple<int, int, int>> all;

    for (int i = 0; i < N; ++i) {
        int a, b;
        cin >> a >> b;
        all.emplace_back(a, b, -1);
    }

    int Q;
    cin >> Q;
    for (int i = 0; i < Q; ++i) {
        int x, y;
        cin >> x >> y;
        all.emplace_back(x, y, i);
    }

    sort(all.begin(), all.end());

    vector<int> ans(Q, -1);
    map<int, int> bunya;
    int prob_count = 0;

    for (int i = 0; i < N + Q; ++i) {
        int a, b, c;
        tie(a, b, c) = all[i];
        if (c == -1) {
            bunya[b]++;
            prob_count++;
        } else {
            ans[c] = prob_count - bunya[b];
        }
    }

    for (int i = 0; i < Q; ++i) {
        cout << ans[i] << endl;
    }

    return 0;
}