#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, e) for (int i = (int)(s); i < (int)(e); ++i)
#define all(a) (a).begin(),(a).end()

int main() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    
    int N;
    cin >> N;
    int diff_max = 100000;
    vector<int> prob(N);
    vector<vector<int>> diff(diff_max);
    rep(i, 0, N) {
        int A, B;
        cin >> A >> B;
        --B;
        diff[B].push_back(A);
        prob[i] = A;
    }
    sort(all(prob));
    rep(i, 0, diff_max) sort(all(diff[i]));
    
    int Q;
    cin >> Q;
    rep(query, 0, Q) {
        int X, Y;
        cin >> X >> Y;
        --Y;
        
        int ans = upper_bound(all(prob), X) - prob.begin();
        ans -= upper_bound(all(diff[Y]), X) - diff[Y].begin();
        cout << ans << '\n';
    }
}