import bisect

def main():
    N = int(input())
    AB = tuple(tuple(map(int, input().split())) for _ in [0] * N)
    M = int(input())
    XY = tuple(tuple(map(int, input().split())) for _ in [0] * M)

    ab = sorted(AB)
    a = [a for a, b in ab]
    b = [b for a, b in ab]
    men = [0] * M
    for i, (x, y) in enumerate(XY):
        j = bisect.bisect_left(a, x)
        b_ = sorted(b[j:])
        k = bisect.bisect(b_, y)
        men[i] += k

    max_ = max(men)
    if not max_:
        print(0)
    else:
        for i in [j for j, k in enumerate(men) if k == max_]:
            print(i + 1)

main()