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

int main(){
    int n;
    std::cin >> n;
    std::pair<int, int> buy[n];
    REP(i, n) {
        std::cin >> buy[i].first >> buy[i].second;
    }
    int m;
    std::cin >> m;
    std::pair<int, int> mentaiko[m];
    int bought[m] = {};
    REP(i, m) {
        std::cin >> mentaiko[i].first >> mentaiko[i].second;
    }

    bool flag = false;
    REP(i, n) {
        int money = buy[i].first;
        int bite = buy[i].second;
        REP(j, m) {
            if(mentaiko[j].first <= money && mentaiko[j].second >= bite) {
                bought[j]++;
                flag = true;
            }
        }
    }
    int *max = max_element(bought, bought+m);
    if(flag) {
        REP(i, m) {
            if(bought[i] == *max) std::cout << i+1 << "\n";
        }
    } else {
        std::cout << "0\n";
    }
}