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

#define INF 1.1e9
#define LINF 1.1e18
#define FOR(i,a,b) for (int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define BIT(x,n) bitset<n>(x)
#define PI 3.14159265358979323846

typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> PP;

//-----------------------------------------------------------------------------

int n,m,x[1000],y[1000],a[10000],b[10000];
int cnt[1000];

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin>>n;
	REP(i,n) cin>>a[i]>>b[i];
	cin>>m;
	REP(i,m) cin>>x[i]>>y[i];
	REP(i,n) {
		REP(j,m) {
			if(a[i]>=x[j]&&b[i]<=y[j]) {
				//cout<<"i,j "<<i<<' '<<j<<endl;
				cnt[j]++;
			}
		}
	}
	int ma=1;
	vector<int> ans;
	REP(i,m) {
		if(cnt[i]>ma) {
			ans.clear();
			ma=cnt[i];
			ans.pb(i);
		}
		else if(cnt[i]==ma) {
			ans.pb(i);
		}
	}
	if(ans.size()==0) cout<<0<<endl;
	else for(auto i:ans) cout<<i+1<<endl;

	return 0;
}