#include <bits/stdc++.h>
#define ALL(x) (x).begin(), (x).end()
#define LB(v, x) (int)(lower_bound(ALL(v), x) - (v).begin())
#define UQ(v) sort(ALL(v)), (v).erase(unique(ALL(v)), (v).end())
#define IO ios::sync_with_stdio(false), cin.tie(nullptr);
#define chmax(a, b) (a) = (a) < (b) ? (b) : (a)
#define chmin(a, b) (a) = (a) < (b) ? (a) : (b)
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

int main() {
    IO;
    int N;
    cin >> N;
    vector<ll> A(N), B(N);
    for (int i = 0; i < N; i++) cin >> A[i] >> B[i];
    const int mx = 2e5;
    vector<vector<ll>> as(mx);
    for (int i = 0; i < N; i++) as[B[i]].push_back(A[i]);
    sort(ALL(A));
    for (int i = 0; i < mx; i++) sort(ALL(as[i]));

    int Q;
    cin >> Q;
    while (Q--) {
        ll x, y;
        cin >> x >> y;
        ll ans = LB(A, x + 1);
        ans -= LB(as[y], x + 1);

        cout << ans << '\n';
    }
}