import math
import sys
def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

n = I()
a = []
for _ in range(n):
    x, y = MI()
    a.append([x, y])

m = I()
k = [0]*m
for j in range(m):
    x, y = MI()
    for i in range(n):
        if x <= a[i][0] and y >= a[i][1]:
            k[j] += 1

max_k = max(k)

if max_k == 0:
    print(0)
else:
    for j in range(m):
        if k[j] == max_k:
            print(j+1)