#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <functional>

#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define MOD 1000000007
#define int long long
using ll = long long;
using namespace std;
const int INF = 1LL << 50;
using P = pair<int, int>;

template <class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    else {
        return false;
    }
}
template <class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    else {
        return false;
    }
}
struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(20);
    }
} SETUP;

signed main() {
    int n; cin >> n;
    vector<P> as(n);
    for (auto&p : as) {
        cin >> p.first >> p.second;
    }

    int m; cin >> m;
    vector<P> xs(m);
    for (auto&p : xs) {
        cin >> p.first >> p.second;
    }

    vector<int> cnts(m);
    rep(i, 0, n) {
        int a = as[i].first, b = as[i].second;
        rep(j, 0, m) {
            int x = xs[j].first, y = xs[j].second;
            if (x <= a && b <= y) {
                cnts[j]++;
            }
        }
    }

    int nax = *max_element(cnts.begin(), cnts.end());
    if (nax <= 0) {
        puts("0");
        return 0;
    }
    set<int> idxs;
    rep(i, 0, m) {
        if (nax == cnts[i]) {
            idxs.insert(i + 1);
        }
    }
    for (auto s : idxs) {
        cout << s << endl;
    }
}