import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write N=int(readline()) A,B=[],[] for _ in range(N): a,b=map(int,readline().split()) A.append(a) B.append(b) M=int(readline()) X,Y=[],[] for _ in range(M): x,y=map(int,readline().split()) X.append(x) Y.append(y) cnt=[0]*M for m in range(M): for n in range(N): if X[m]<=A[n] and Y[m]>=B[n]: cnt[m]+=1 m=max(cnt) if m: for ans in range(M): if cnt[ans]==m: print(ans+1) else: print(0)