#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef pair<int, pair<int, int> > piii;
typedef long long ll;
const int N = 2000086, MOD = 998244353, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];


struct Node {
    int a, b;
    bool operator<(const Node& w) const {
        return a < w.a;
    }
}e[N];
map<int, vector<int> > ma;


int main() {
    cin >> n;
    for (int i = 1; i < n + 1; i++) scanf("%d%d", &e[i].a, &e[i].b), ma[e[i].b].push_back(e[i].a);
    sort(e + 1, e + n + 1);
    for (auto& u : ma) sort(u.second.begin(), u.second.end());
    cin >> m;
    e[n + 1] = {INF, 0};
    while (m--) {
        int a, b;
        scanf("%d%d", &a, &b);
        int res = lower_bound(e + 1, e + n + 2, (Node){a + 1, 0}) - (e + 1);
        if (ma.count(b)) {
            res -= lower_bound(ma[b].begin(), ma[b].end(), a + 1) - ma[b].begin();
        }
        printf("%d\n", res);
    }
    return 0;
}