#include <iostream>
#include <array>
#include <vector>
#include <algorithm>

using namespace std;

int main() {

    int N;

    cin >> N;

    vector<int> as(N);
    vector<int> bs(N);

    for (int i = 0; i < N; ++i) {
        cin >> as[i] >> bs[i];
    }

    int M;
    cin >> M;

    vector<int> xs(M);
    vector<int> ys(M);

    for (int j = 0; j < M; ++j) {
        cin >> xs[j] >> ys[j];
    }

    vector<int> counters(M);

    for (int k = 0; k < M; ++k) {
        for (int i = 0; i < N; ++i) {

            if (xs[k] <= as[i] && ys[k] >= bs[i]) {
                counters[k] += 1;
            }
        }
    }

    int maxElem = *std::max_element(counters.begin(), counters.end());

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


    for (int l = 0; l < M; ++l) {
        if (counters[l] == maxElem) {
            cout << (l + 1) << endl;
        }
    }

    cout << "\n";


    return 0;

}