#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int (i)=(0);(i)<(int)(n);++(i))
using ll = long long;
using P = pair<int, int>;
using namespace std;

template<class T> void vin(vector<T>& v, int n) {
    v.resize(n);
    for (int i = 0; i < n; ++i) {
        cin >> v[i];
    }
}

int a[10001], b[10001];
int x[1001], y[1001];

int xy[10001];

int main() {
    int n;
    cin >> n;
    rep(i, n) cin >> a[i] >> b[i];
    int m;
    cin >> m;
    rep(i, m) cin >> x[i] >> y[i];
    rep(i, m) {
        rep(j, n) {
            if (a[j] >= x[i] and b[j] <= y[i]) xy[i]++;
        }
    }
    int ma = 0;
    vector<int> ans;
    rep(i, m) {
        if (ma < xy[i]) {
            ans.clear();
            ma = xy[i];
            ans.push_back(i+1);
        }
        else if (ma > 0 and ma == xy[i]) {
            ans.push_back(i+1);
        }
    }
    for (auto i : ans) cout << i << endl;
    if (ans.size() == 0) cout << 0 << endl;
    return 0;
}