#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

int main(){
  int N; cin >> N;
  vector<int> A(N);
  vector<int> B(N);
  rep(i,N) cin >> A[i] >> B[i];
  int M; cin >> M;
  vector<int> X(M);
  vector<int> Y(M);
  rep(i,M) cin >> X[i] >> Y[i];
  vector<int> cnt(M,0);
  rep(i,N){
    rep(j,M){
      if(A[i]>=X[j]&&B[i]<=Y[j]) cnt[j]++;
    }
  }
  int mx = *max_element(all(cnt));
  if(mx==0) cout << 0 << endl;
  else{
    rep(j,M) if(cnt[j]==mx) cout << j+1 << endl;
  }
  return 0;
}