import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = 10**16
# md = 998244353
md = 10**9+7

class BitSum:
    def __init__(self, n):
        self.n = n+1
        self.table = [0]*self.n

    def add(self, i, x):
        i += 1
        while i < self.n:
            self.table[i] += x
            i += i & -i

    # [0,i]の和
    def sum(self, i):
        i += 1
        res = 0
        while i > 0:
            res += self.table[i]
            i -= i & -i
        return res

    # [l,r)の和
    def sumlr(self, l, r):
        if l >= r: return 0
        if l == 0: return self.sum(r-1)
        return self.sum(r-1)-self.sum(l-1)

    # 数列を度数分布とみたときに、x番目がどのインデックスにあるかを返す
    # xが大きすぎるときは配列の長さnを返す
    def rank(self, x):
        idx = 0
        for lv in range((self.n-1).bit_length()-1, -1, -1):
            mid = idx+(1 << lv)
            if mid >= self.n: continue
            if self.table[mid] < x:
                x -= self.table[mid]
                idx += 1 << lv
        return idx

n = II()
ab = LLI(n)
m = II()
xyk = []
by = set()
for i in range(m):
    x, y = LI()
    xyk.append((x, y, i+1))
    by.add(y)

for a, b in ab: by.add(b)
enc = {b: i for i, b in enumerate(sorted(by))}

bit = BitSum(len(enc))
xyk.sort(key=lambda x: -x[0])
ab.sort(key=lambda x: x[0])

ans = []
mx = 0
for x, y, k in xyk:
    while ab and ab[-1][0] >= x:
        a, b = ab.pop()
        b = enc[b]
        bit.add(b, 1)
    y = enc[y]
    cur = bit.sum(y)
    if cur == mx:
        ans.append(k)
    if cur > mx:
        mx = cur
        ans = [k]

if mx == 0:
    print(0)
else:
    ans.sort()
    for a in ans: print(a)