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

using namespace std;

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

	cin >> m;
	vector<int> x(m), y(m);
	for (int i = 0; i < m; i++) {
		cin >> x[i] >> y[i];
	}


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

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