import Control.Monad (replicateM)
import Data.ByteString.Char8 (ByteString)
import qualified Data.ByteString.Char8 as B
import Data.List
import Data.Char (isSpace)

main :: IO ()
main = do
  n <- getl $ readi B.readInt
  abs <- replicateM n (getl $ readil B.readInt)
  m <- getl $ readi B.readInt
  xys <- replicateM m (getl $ readil B.readInt)
  mapM_ print $ solve abs xys

solve :: [[Int]] -> [[Int]] -> [Int]
solve abs xys
  | null ls = [0]
  | otherwise = mls
  where
    ls = [i | [a, b] <- abs, (i, [x, y]) <- zip [1..] xys, a >= x && b <= y]
    sls = map (\p -> (length p, head p)) . group . sort $ ls
    mxl = maximum . map fst $ sls
    mls = sort $ map snd $ filter (\q -> fst q == mxl) sls

getl :: (ByteString -> a) -> IO a
getl f = f <$> B.getLine

readi :: Integral a =>  (ByteString -> Maybe (a, ByteString)) -> ByteString -> a
readi f s = let Just (n, _) = f s in n

readil :: Integral a =>  (ByteString -> Maybe (a, ByteString)) -> ByteString -> [a]
readil f = unfoldr g
  where
    g s = do
      (n, s') <- f s
      return (n, B.dropWhile isSpace s')