#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;

int main() {
	int N; cin >> N;
	vector<pair<int, int>>A(N);
	for (int i = 0; i < N; i++) {
		int a, b; cin >> a >> b;
		A[i] = make_pair(a, b);
	}
	int M; cin >> M;
	vector<pair<int, int>>B(M);
	for (int i = 0; i < M; i++) {
		int x, y; cin >> x >> y;
		B[i] = make_pair(x, y);
	}

	vector<int>cnt(M);
	for (int i = 0; i < N; i++) {
		for (int j = 0; j < M; j++) {
			if (A[i].first >= B[j].first && A[i].second <= B[j].second)cnt[j]++;
		}
	}

	int max_cnt = 1;
	vector<int>ans;
	for (int i = 0; i < M; i++) {
		if (cnt[i] > max_cnt) {
			ans.clear();
			ans.push_back(i);
			max_cnt = cnt[i];
		}
		else if (cnt[i] == max_cnt) {
			ans.push_back(i);
		}
	}

	if(ans.size())for (int i = 0; i < ans.size(); i++)cout << ans[i]+1 << endl;
	else cout << 0 << endl;

	return 0;
}