#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll,ll> P;
#define REP(i,n) for(ll i=0;i<ll(n);i++)











int main(void){
	cin.tie(nullptr);  ios_base::sync_with_stdio(false);
	ll i,j;


	ll N;
	cin >> N;

	map<ll,vector<ll>> m;
	vector<P> e(N);
	for(i=0;i<N;i++){
		ll A,B;
		cin >> A >> B;
		e[i].first=A;
		e[i].second=B;
	}

	sort(e.begin(),e.end());

	REP(i,N) m[e[i].second].push_back(e[i].first);
	vector<ll> a(N);
	REP(i,N) a[i]=e[i].first;

	sort(a.begin(),a.end());


	ll Q;
	cin >> Q;

	vector<ll> b(N,0);
	while(Q--){
		ll X,Y;
		cin >> X >> Y;

		ll x=upper_bound(a.begin(),a.end(),X)-a.begin();

		if(x==0){
			cout << 0 << endl;
			continue;
		}

		ll ans=x;
		vector<ll> d=m[Y];

		ll s=upper_bound(d.begin(),d.end(),a[x-1])-lower_bound(d.begin(),d.end(),a[0]);

		ans-=s;
		cout << ans << endl;




	}





	return 0;
}