from sortedcontainers import SortedList
import bisect

n = int(input())
items = [list(map(int, input().split())) for i in range(n)]
items.sort(key=lambda x: (x[0], x[1]))
cnt = [SortedList() for _ in range(10**5+30)]
idxs = []
for i in range(n):
    idxs.append(items[i][0])
    cnt[items[i][1]].add(items[i][0])
idxs.sort()
q = int(input())
for i in range(q):
    x, y = map(int, input().split())
    ans = bisect.bisect_right(idxs, x) - cnt[y].bisect_right(x)
    print(ans)