#include <iostream>
#include <iomanip>
#include <cassert>
#include <vector>
#include <algorithm>
#include <utility>
#include <numeric>
// #include "Src/Utility/BinarySearch.hpp"
// #include "Src/Sequence/CompressedSequence.hpp"
// #include "Src/Sequence/RunLengthEncoding.hpp"
// using namespace zawa;
// #include "atcoder/modint"
// using mint = atcoder::modint998244353;
int N;
std::pair<int, int> AB[200010];
std::vector<int> ord[100010];
int main() {
    std::cin.tie(nullptr);
    std::cout.tie(nullptr);
    std::ios::sync_with_stdio(false);
    std::cin >> N;
    for (int i = 0 ; i < N ; i++) std::cin >> AB[i].first >> AB[i].second;
    std::sort(AB, AB + N);
    for (int i = 0 ; i < N ; i++) ord[AB[i].second].push_back(i);
    int Q;
    std::cin >> Q;
    while (Q--) {
        int X, Y;
        std::cin >> X >> Y;
        auto it = std::lower_bound(AB, AB + N, std::pair{X, (int)1e9}) - AB;
        auto jt = std::lower_bound(ord[Y].begin(), ord[Y].end(), it) - ord[Y].begin();
        std::cout << it - jt << '\n';
    }
}