#include <iostream>
#include <vector>
#include <algorithm>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

int main(){
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int n; cin >> n;
    vi a(n);
    vvi b(100010);
    rep(i, n){
        int d; cin >> a[i] >> d;
        b[d].push_back(a[i]);
    }
    rep(i, 100010){
        if(b[i].size() == 0)continue;
        sort(all(b[i]));
    }
    sort(all(a));
    int q; cin >> q;
    while(q--){
        int x, y; cin >> x >> y;
        int e = upper_bound(all(a), x) - begin(a);
        int f = 0;
        if(b[y].size() > 0){
            f = upper_bound(all(b[y]), x) - begin(b[y]);
        }
        cout << e-f << endl;
    }

    return 0;
}