N=int(input())
D={};A=[]
for i in range(N):
  a,b=map(int,input().split())
  A.append(a)
  if b not in D:
    D[b]=[]
  D[b].append(a)
  
A=sorted(A)
for d in D:
  D[d]=sorted(D[d])

import bisect 
Q=int(input())
for i in range(Q):
  a,b=map(int,input().split()) 
  ans=bisect.bisect_right(A,a)
  if b in D:
    ans-=bisect.bisect_right(D[b],a)
  print(ans)