from bisect import bisect_right
N= int(input())
A = [list(map(int,input().split())) for _ in range(N)]
Q = int(input())
X = [list(map(int,input().split())) for _ in range(Q)]
B = {}
for i in range(N):
    a,b = A[i]
    if b not in B:
        B[b] = []
    B[b].append(a)
for b in B:
    B[b] = sorted(B[b])
A = sorted([A[i][0] for i in range(N)])
for k in range(Q):
    x,y = X[k]
    indx = bisect_right(A,x)
    if y not in B:
        print(indx)
    else:
        indy = bisect_right(B[y],x)
        print(indx-indy)