from bisect import bisect_right

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

for k in d.keys():
    d[k].sort()
A.sort()

Q = int(input())
for i in range(Q):
    x, y = map(int, input().split())
    cnt = bisect_right(A, x)
    if y in d:
        cnt -= bisect_right(d[y], x)
    print(cnt)