#include <bits/stdc++.h>
using namespace std;
struct cww{cww(){ios::sync_with_stdio(false);cin.tie(0);}}star;
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define vv(type, c, m, n, i) vector<vector<type>> c(m, vector<type>(n, i))
#define rep(i,a,n) for(int i=(a), i##_len=(n); i<i##_len; ++i)
#define rrep(i,a,n) for(int i=(a), i##_len=(n); i>i##_len; --i)
#define len(x) ((int)(x).size())
#define mp make_pair
#define eb emplace_back
#define em emplace
#define fi first
#define se second
#define min(v) *min_element(v)
#define max(v) *max_element(v)
#define sum(a, b) accumulate(a, b)
#define chmax(a,b) if(a<b)a=b
#define chmin(a,b) if(a>b)a=b
template <class T> inline void print(T t){cout << t << "\n";}
template <class H, class... T> inline void print(H h, T... t){cout << h << " ";print(t...);}
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long> vll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> pii;
int main() {
	int n; cin >> n;
	vector<pii> vii(n);
	rep(i, 0, n) {
		cin >> vii[i].fi >> vii[i].se;
	}
	sort(rall(vii));
	int m; cin >> m;
	int x, y;
	unordered_map<int, vi> ans;
	int max_v = 0;
	rep(i, 0, m) {
		int cnt = 0;
		cin >> x >> y;
		rep(j, 0, n) {
			if (vii[j].fi < x)
				break;
			if (vii[j].se <= y) {
				++cnt;
			}
		}
		chmax(max_v, cnt);
		ans[cnt].eb(i + 1);
	}
	if (max_v == 0)
		print(0);
	else {
		for (int a : ans[max_v])
			print(a);
	}
	return 0;
}