#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    int n;
    cin>>n;
    pair<int, int> a[n];
    for (int i = 0; i < n; i++) {
        int b, c;
        cin >> b >> c;
        a[i] = { b, c };
    }
    int m;
    cin >> m;
    int cnt[m] {};
    for (int i = 0; i < m; i++) {
        int x, y;
        cin >> x >> y;
        for (int j = 0; j < n; j++) {
            if (x <= a[j].first && y >= a[j].second) cnt[i]++;
        }
    }
    int mx = 0;
    for (int i : cnt) mx = max(mx, i);
    if (mx == 0) {
        cout << 0 << endl;
        return 0;
    }
    for (int i = 0; i < m; i++) if (cnt[i] == mx) cout << i+1 << endl;
    return 0;
}