#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

const ll MX = 100010;
void solve() {
  ll n;
  cin >> n;
  vector<ll> as;
  vector<vector<ll>> bas(MX + 10);
  rep(i, n) {
    ll a, b;
    cin >> a >> b;
    as.push_back(a);
    bas[b].push_back(a);
  }
  sort(as.begin(), as.end());
  rep(i, MX) sort(bas[i].begin(), bas[i].end());
  ll q;
  cin >> q;
  rep(qi, q) {
    ll x, y;
    cin >> x >> y;
    ll ans = 0;
    ans += upper_bound(as.begin(), as.end(), x) - as.begin();
    ans -= upper_bound(bas[y].begin(), bas[y].end(), x) - bas[y].begin();
    cout << ans << '\n';
  }
}

int main() {
  std::cin.tie(nullptr);
  std::ios_base::sync_with_stdio(false);
  int T = 1;
  for (int t = 0; t < T; t++) {
    solve();
  }
  return 0;
}