#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	int N;
	cin >> N;
	vector<int> A(N);
	vector<int> B(N);
	
	for (int i = 0; i < N; i++) {
		cin >> A[i] >> B[i];
		//res[i].second = i;
	}
	int M;
	cin >> M;
	vector<int> X(M);
	vector<int> Y(M);

	vector<pair<int, int> >res(M, make_pair(0, 0));
	for (int i = 0; i < M; i++) {
		cin >> X[i] >> Y[i];
		res[i].second = i;
		for (int j = 0; j < N; j++) {
			if (X[i] <= A[j] && Y[i] >= B[j]) {
				res[i].first--;
			}
		}
	}
	sort(res.begin(), res.end());
	if (res[0].first == 0) {
		cout << 0 << endl;
	}
	else {
		for (int i = 0; i < M; i++) {
			if (res[i].first == res[0].first) {
				cout << res[i].second + 1 << endl;
			}
			else {
				break;
			}
		}
	}
}