#include <bits/stdc++.h>
using namespace std;

int main()
{
	int N;
	cin >> N;
	vector<int> A( N );
	vector<int> B( N );
	for( int i = 0; i < N; i++ ) {
		cin >> A[i] >> B[i];
	}
	int M;
	cin >> M;
	vector<pair<int, int>> XY( M );
	for( int i = 0; i < M; i++ ) {
		cin >> XY[i].first >> XY[i].second;
	}

	sort( XY.begin(), XY.end() );
	vector<int> v( M );
	for( int i = 0; i < N; i++ ) {
		int j = lower_bound( XY.begin(), XY.end(), make_pair( A[i], 0 ) ) - XY.begin();
		if( j == 0 && XY[j].first > A[i] ) continue;
		if( j >= M ) j--;
		for( ; j >= 0; j-- ) {
			if( XY[j].second < B[i] ) continue;
			v[j]++;
		}
	}
	int ma = *max_element( v.begin(), v.end() );

	if( ma == 0 ) {
		cout << 0 << endl;
	}
	else {
		for( int i = 0; i < M; i++ ) {
			if( v[i] < ma ) continue;
			cout << i + 1 << endl;
		}
	}
}