#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

int N, M, A[10010], B[10010], X[1010], Y[1010];
int cnt[1010];

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    std::cin >> N;

    for(int i=0;i<N;++i){
        std::cin >> A[i] >> B[i];
    }

    std::cin >> M;

    for(int i=0;i<M;++i){
        std::cin >> X[i] >> Y[i];
    }

    for(int i=0;i<M;++i){
        for(int j=0;j<N;++j){
            if(X[i] <= A[j] && Y[i] >= B[j]){
                ++cnt[i];
            }
        }
    }

    int mx = *max_element(cnt, cnt+M);
    if(mx == 0){
        std::cout << 0 << std::endl;
    }else{
        for(int i=0;i<M;++i){
            if(cnt[i] == mx){
                std::cout << (i + 1) << std::endl;
            }
        }
    }
}