#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<fstream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

template < typename T >
void vprint(T &V){
	for(auto v : V){
    	cout << v << " ";
	}
	cout << endl;
}

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

    // input
    ll N;
    cin >> N;

    vector<ll> A(N);
    vector<ll> B(N);

    FOR(i, 0, N){
        cin >> A[i] >> B[i];
    }

    ll M;
    cin >> M;

    vector<ll> X(M);
    vector<ll> Y(M);

    FOR(i, 0, M){
        cin >> X[i] >> Y[i];
    }

    vector<ll> count(M);

    FOR(i, 0, M){
        FOR(j, 0, N){
            if(X[i] <= A[j] && Y[i]>=B[j]){
                count[i]++;
            }
        }
    }
    ll max_count = *max_element(ALL(count));

    if(max_count==0){
        p(0);
        return 0;
    }

    FOR(i, 0, M){
        if(count[i]==max_count){
            p(i+1);
        }
    }
    
    return 0;
}