#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int main() {
  int n;
  cin >> n;

  vector<int> a(n), b(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i] >> b[i];
  }

  int m;
  cin >> m;

  vector<int> cnt(m);
  for (int i = 0; i < m; i++) {
    int x, y;
    cin >> x >> y;
    for (int j = 0; j < n; j++) {
      cnt[i] += x <= a[j]&& y >= b[j];
    }
  }

  int mx = *max_element(cnt.begin(), cnt.end());
  if (mx == 0) {
    cout << 0 << endl;
    return 0;
  }
  for (int i = 0; i < m; i++) {
    if (cnt[i] == mx) {
      cout << i + 1 << endl;
    }
  }
}