#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <math.h>
#include <utility>
#include <vector>
using namespace std;


int main(void)
{
    int n;
    cin >> n;

    int a[n];
    int b[n];
    for(int i = 0; i < n; i++)
        cin >> a[i] >> b[i];

    int m;
    cin >> m;

    int x[m];
    int y[m];
    for(int i = 0; i < m; i++)
        cin >> x[i] >> y[i];
    
    int z[m] = {0};
    int max = 0;
    for(int i = 0; i < m; i++)
    {
        for(int j = 0; j < n; j++)
        {
            if(x[i]<=a[j] && y[i]>=b[j])
                z[i]++; 
        }
        if(max<z[i])
            max = z[i];
    }

    if(max == 0)
    {
        cout << 0 << endl;
        return 0;
    }

    for(int i = 0; i < m; i++)
        if(z[i]==max)
            cout << i+1 << endl;


    
    return 0;
}