#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = (a >= b ? a : b)
#define chmin(a, b) a = (a <= b ? a : b)
#define out(a) cout << a << endl
#define outa(a, n) rep(_, n) cout << a[_] << " "; cout << endl
#define SZ(v) (int)v.size()
#define inf (int)(1e9+7)
#define abs(x) (x >= 0 ? x : -(x))
#define ceil(a, b) a / b + !!(a % b)
#define FIX(a) fixed << setprecision(a)

int main() {
    int n, m;
    cin >> n;
    int a[n], b[n];
    rep(i, n) cin >> a[i] >> b[i];
    cin >> m;
    int x[m], y[m];
    rep(i, m) cin >> x[i] >> y[i];
    int c[m];
    fill_n(c, m, 0);
    rep(i, n) {
        rep(j, m) {
            if (x[j] <= a[i] && b[i] <= y[j]) c[j]++;
        }
    }
    int val = *max_element(c, c + m);
    if (val == 0) out(0);
    else {
        rep(i, m) if (c[i] == val) out(i + 1);
    }
}