using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var map = NArr(n);
        var m = NN;
        var count = new int[m];
        var max = 0;
        for (var i = 0; i < m; ++i)
        {
            var c = NList;
            for (var j = 0; j < n; ++j) if (c[0] <= map[j][0] && map[j][1] <= c[1]) ++count[i];
            max = Math.Max(max, count[i]);
        }
        if (max == 0)
        {
            WriteLine(0);
            return;
        }
        var ans = new List<int>();
        for (var i = 0; i < m; ++i) if (count[i] == max) ans.Add(i + 1);
        WriteLine(string.Join("\n", ans));
    }
}