N = int(input())
P = []
G = [[] for n in range(100001)]
for _ in range(N):
  A, B = map(int, input().split())
  G[B].append(A)
  P.append(A)
P.sort()
for n in range(100001):
  G[n].sort()

from bisect import *
for _ in range(int(input())):
  X, Y = map(int, input().split())
  ans = bisect_right(P, X) - bisect_right(G[Y], X)
  print(ans)