n=int(input())
L=10**5
p1=[]
p2=[[] for i in range(L)]
for i in range(n):
  a,b=map(int,input().split())
  p1+=[a]
  p2[b-1]+=[a]
p1.sort()
for i in range(L):
  p2[i].sort()
from bisect import bisect_right
Q=int(input())
for _ in range(Q):
  x,y=map(int,input().split())
  c=0
  c+=bisect_right(p1,x)
  c-=bisect_right(p2[y-1],x)
  print(c)