#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <iomanip>
using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=(b-1);i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

ll d[100100];

int main() {
  ll n;
  cin>>n;
  vector<ll> v1;
  vector<ll> v2;
  vector<ll> v3;
  vector<ll> v4;
  rep(i,0,n){
    ll a,b;
    cin>>a>>b;
    v1.pb(a);
    v2.pb(b);
  }
  ll m;
  cin>>m;
  rep(i,0,m){
    ll a,b;
    cin>>a>>b;
    vector<ll> v1;
    vector<ll> v2;
    v3.pb(a);
    v4.pb(b);
  }
  clr(d,0);
  rep(i,0,v1.sz){
    rep(j,0,v3.sz){
      if(v1[i]>=v3[j]&&v2[i]<=v4[j])d[j]++;
    }
  }
  ll mx = 0;
  rep(i,0,m){
    mx = max(mx,d[i]);
  }
  vector<ll> ans;
  rep(i,0,m){
    if(d[i]==mx){
      ans.pb(i+1);
    }
  }
  if(mx==0){
    cout << 0 << endl;
    return 0;
  }
  rep(i,0,ans.sz){
    cout << ans[i] << endl;
  }
  return 0;
}