import bisect

N=int(input())
bunya=[[] for i in range(2*10**5)]
mem=[]
for i in range(N):
    A,B=(int(x) for x in input().split())
    mem.append(A)
    bunya[B-1].append(A)
mem=sorted(mem)
for i in range(len(bunya)):
    bunya[i] = sorted(bunya[i])
Q=int(input())
for i in range(Q):
    X,Y=(int(x) for x in input().split())
    idx=bisect.bisect_right(mem,X)
    idxn=bisect.bisect_right(bunya[Y-1], X)
    print(idx-idxn)