from bisect import bisect_right

n = int(input())
all_ = []
A = [[] for _ in range(100010)]
for _ in range(n):
    a, b = map(int, input().split())
    all_.append(a)
    A[b].append(a)

all_.sort()
for i in range(100010):
    A[i].sort()

Q = int(input())
for _ in range(Q):
    x, y = map(int, input().split())
    ans = bisect_right(all_, x) - bisect_right(A[y], x)
    print(ans)