#include <bits/stdc++.h>
using namespace std;
int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N;
    cin >> N;
    vector<pair<int, int>> X(N);
    for (int i = 0; i < N; i++) cin >> X[i].first >> X[i].second;
    sort(X.begin(), X.end());
    int Q;
    cin >> Q;
    vector<pair<int, int>> Y(Q);
    for (int i = 0; i < Q; i++) cin >> Y[i].first >> Y[i].second;
    const int maxn = 100010;
    vector<vector<int>> idx(maxn);
    for (int i = 0; i < N; i++) {
        idx[X[i].second].push_back(X[i].first);
    }
    vector<int> S(N);
    for (int i = 0; i < N; i++) S[i] = X[i].first;
    for (int i = 0; i < Q; i++) {
        int x = Y[i].first, y = Y[i].second;
        int cnt = upper_bound(S.begin(), S.end(), x) - S.begin();
        int ex = upper_bound(idx[y].begin(), idx[y].end(), x) - idx[y].begin();
        cout << cnt - ex << "\n";
    }
}