#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)

int main(){
    int n;
    cin >> n;
    vector<P> v(n);
    // vector<int> v(n);

    rep(i, n){
        cin >> v[i].first >> v[i].second;
    }
    sort(v.begin(), v.end());
    // VI v2(n);
    // rep(i, n){
    //     v2[i] = v[i].first;
    // }
    int q;
    cin >> q;
    VI ans(q);
    vector<vector<int>> xy(q, VI(3));
    rep(i, q){
        int x, y;
        cin >> x >> y;
        xy[i][0] = x; xy[i][1] = y; xy[i][2] = i;
    }
    sort(xy.begin(), xy.end());

    vector<int> cntB(1e5+1, 0);
    int idx = -1;
    rep(i, q){
        while(idx+1 <= n-1 && v[idx+1].first <= xy[i][0]){
            idx++;
            int b = v[idx].second;
            cntB[b]++;
            // cout << 'b' << v[idx+1].first << ' ' << xy[i][0] << endl;
        }
        int y = xy[i][1], qi = xy[i][2];
        ans[qi] = idx+1 - cntB[y];
        // cout << idx+1 << ' ' << cntB[y]<< endl;
    }
    rep(i, q){
        cout << ans[i] << "\n";
    }

}