#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;cin>>n;
    vector<pair<int,int>> v(n);
    rep(i,0,n)cin>>v[i].fi>>v[i].se;
    int m;cin>>m;
    vector<pair<int,int>> vv(m);
    rep(i,0,m)cin>>vv[i].fi>>vv[i].se;
    
    vector<int> ct(m,0);
    rep(j,0,n){
        rep(i,0,m){
            if(vv[i].fi<=v[j].fi&&v[j].se<=vv[i].se)ct[i]++;
        }
    }
    
    int ans=0;
    bool f=true;
    rep(i,0,m)ans=max(ans,ct[i]);
    if(!ans){
        cout<<ans<<endl;
        return 0;
    }
    rep(i,0,m){
        if(ans==ct[i]){
            cout<<i+1<<endl;
            f=false;   
        }
    }
    return 0;
}