#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
#define REP(i,n) for(int i=0; i<int(n); i++)
#define FOR(i,m,n) for(int i=int(m); i<int(n); i++)
#define ALL(obj) (obj).begin(),(obj).end()
#define VI vector<int>
#define VLL vector<long long>
#define VVI vector<vector<int>>
#define VVLL vector<vector<long long>>
#define VC vector<char>
#define VS vector<string>
#define VVC vector<vector<char>>
#define fore(i,a) for(auto &i:a)

typedef pair <int, int> P;
template<class T> bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }
const int  INF = 2147483647;
const ll INFL = 9223372036854775807;
const ll mod = 1000000007;





int main() {
	
	int n, m;
	cin >> n;
	VI a(n), b(n);
	REP(i, n)cin >> a[i] >> b[i];
	cin >> m;
	VI c(m, 0);

	REP(i, m) {
		int x, y;
		cin >> x >> y;
		REP(j, n) {
			if (x <= a[j] && b[j] <= y)c[i]++;
		}
	}


	VI v;
	int tmp = 0;
	REP(i, m) {
		if (c[i] == tmp)v.push_back(i + 1);
		else if (c[i] >= tmp) {
			tmp = c[i];
			v = {};
			v.push_back(i + 1);
		}
	}

	if (tmp == 0) {
		cout << 0 << endl;
		return 0;
	}

	REP(i, v.size()) {
		cout << v[i] << endl;
	}


	return 0;
}