#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < (int)n; i++)
int main() {
  int n;
  cin >> n;
  map<int, vector<int>> problem;
  rep(i, n) {
    int a, b;
    cin >> a >> b;
    problem[a].push_back(b);
  }
  int q;
  cin >> q;
  rep(i, q) {
    int x, y;
    cin >> x >> y;
    int ans = 0;
    for (auto it = problem.begin(); it != problem.end() && it->first <= x; it++) {
      int tmp = 0;
      rep(j, (int)(it->second.size()))
	  if ((it->second)[j] != y) tmp++;
      ans += tmp;
    }
    cout << ans << endl;
  }
  return 0;
}