#include<iostream>
#include<map>
#include<vector>
#include <algorithm>
using namespace std;

int main()
{
    int n, m, max1 = 0;
    cin >> n;
    vector<vector<int>> mem(n, vector<int> (2));
    for (int i = 0; i < n; i++) cin >> mem[i][0] >> mem[i][1];
    cin >> m;
    vector<vector<int>> ment(m, vector<int> (2));
    for (int i = 0; i < n; i++) cin >> ment[i][0] >> ment[i][1];
    vector<int> bought(m, 0);
    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++){
            if (ment[j][0] <= mem[i][0] && ment[j][1] >= mem[i][1]) bought[j]++;
        }
    }
    vector<int> mir = {0};
    for (int i = 0; i < m; i++){
        if (bought[i] > max1){
            max1 = bought[i];
            mir.clear();
            mir.push_back(i+1);
        } else if (bought[i] && (bought[i] == max1)){
            mir.push_back(i+1);
        }
    }
    for (auto x : mir) cout << x << endl;
}