#include <bits/stdc++.h>
using namespace std;
int main(){
	int N;
	cin >> N;
	vector<int> A(N), B(N);
	map<int, vector<int>> mp;
	for (int i = 0; i < N; i++){
		cin >> A[i] >> B[i];
		mp[B[i]].push_back(A[i]);
	}
	sort(A.begin(), A.end());
	for (auto [k, v] : mp){
		sort(mp[k].begin(), mp[k].end());
	}
	int Q;
	cin >> Q;
	while (Q--){
		int X, Y;
		cin >> X >> Y;
		cout << (upper_bound(A.begin(), A.end(), X) - A.begin()) - (upper_bound(mp[Y].begin(), mp[Y].end(), X) - mp[Y].begin()) << endl;
	}
}