n = int(input())
a,b = [0]*n,[0]*n
for i in range(n):
    a[i],b[i] = map(int,input().split())
m = int(input())
cnt = [0]*m
for j in range(m):
    x,y = map(int,input().split())
    for i in range(n):
        if x <= a[i] and b[i] <= y:
            cnt[j] += 1
Max = max(cnt)
if Max == 0:
    print(0)
    exit(0)
for i in range(m):
    if cnt[i] == Max:
        print(i + 1)