#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>
#include <map>

#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vi vector<int>
#define INF (int)1e933
#define INFL 1e18
#define MOD 1e9+7
#define pb push_back
#define MP make_pair
typedef long long ll;
typedef std::pair<int,int> pii;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

using namespace std;

int main() {
    int n,m;
    cin>>n;
    vector<int> A(n),B(n);
    rep(i,0,n)cin>>A[i]>>B[i];
    cin>>m;
    vector<int> X(m),Y(m);
    rep(i,0,m)cin>>X[i]>>Y[i];
    
    vector<int> count(m);
    rep(i,0,n){
        rep(j,0,m){
            if(X[j]<=A[i]&&B[i]<=Y[j])count[j]++;
        }
    }
    
    int maxx=0;
    rep(i,0,m) maxx=max(maxx,count[i]);
    if(maxx==0){
        cout<<0<<endl;
        return 0;
    }
    rep(i,0,m) if(count[i]==maxx)cout<<i+1<<endl;
    return 0;
}