import bisect

n = int(input())
A, B = [], [[] for _ in range(10**5+1)]
for i in range(n):
    a, b = map(int, input().split())
    A.append(a)
    B[b].append(a)

A.sort()
for i in range(len(B)):
    B[i].sort()
    
q = int(input())
ans = []
for i in range(q):
    x, y = map(int, input().split())
    t = bisect.bisect_right(A, x) - bisect.bisect_right(B[y], x)
    ans.append(t)

for s in ans:
    print(s)