#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h> 
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#include <ctype.h>
#include <set>
#include <sstream>

using namespace std;


int main() {
	int i, j, k;   
	int n, m;
	vector<pair<long, long>>ab, xy;

	cin >> n;

	for (i = 0; i < n; i++) {
		long a, b;
		cin >> a >> b;
		ab.push_back(make_pair(a, b));
	}

	cin >> m;

	vector<int>ans;
	

	for (i = 0; i < m; i++) {
		long x, y;
		cin >> x >> y;
		xy.push_back(make_pair(x, y));
		int cnt = 0;
		for (j = 0; j < n; j++) {
			if (ab[j].first >= x && ab[j].second <= y) {
				cnt++;
			}
		}
		ans.push_back(cnt);
	}

	int maxnum = 0;

	for (i = 0; i < ans.size(); i++) {
		maxnum = max(maxnum, ans[i]);
	}

	if (maxnum == 0) {
		cout << 0 << endl;
	}
	else {

		for (i = 0; i < ans.size(); i++) {
			if (ans[i] == maxnum) {
				cout << i + 1 << endl;
			}
		}
	}








	getchar();
	getchar();
	return 0;
}