class nibutan:
  @staticmethod
  def nibutan(ok, ng, op):
    while abs(ok - ng) > 1:
      mid = (ok + ng) // 2
      if op(mid):
        ok = mid
      else:
        ng = mid
    return ok
  @staticmethod
  def lt(L, n):
    """Lのうちn未満の最大の要素"""
    if L[0] >= n: return -1
    def op(mid):
      return L[mid] < n 
    ok = 0
    ng = len(L)
    return nibutan.nibutan(ok, ng, op)

  @staticmethod
  def le(L, n):
    """Lのうちn以下の最大の要素"""
    if L[0] > n: return -1
    def op(mid):
      return L[mid] <= n 
    ok = 0
    ng = len(L)
    return nibutan.nibutan(ok, ng, op)
      
  @staticmethod
  def gt(L, n):
    """Lのうちn超過の最小の要素"""
    if L[-1] <= n: return len(L)
    def op(mid):
      return L[mid] > n 
    ok = len(L) - 1
    ng = -1
    return nibutan.nibutan(ok, ng, op)
      
  @staticmethod
  def ge(L, n):
    """Lのうちn以上の最小の要素"""
    if L[-1] < n: return len(L)
    def op(mid):
      return L[mid] >= n 
    ok = len(L) - 1
    ng = -1
    return nibutan.nibutan(ok, ng, op)

N = int(input())
AB = [list(map(int, input().split())) for _ in range(N)]
Q = int(input())
XY = [list(map(int, input().split())) for _ in range(Q)]

A = [AB[i][0] for i in range(N)]
A.sort()
M = 10 ** 5 + 1
AL = [[] for _ in range(M)]
for a, b in AB:
  AL[b].append(a)
for i in range(M):
  AL[b].sort()

for x, y in XY:
  a = nibutan.le(A, x) + 1
  if len(AL[y]) > 0:
    b = nibutan.le(AL[y], x) + 1
  else:
    b = 0
  ans = a - b
  print(ans)