#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define CK(N, A, B) (A <= N && N < B)
#define REP(i, a, b) for (int i = a; i < b; i++)
#define RREP(i, a, b) for (int i = (b - 1); a <= i; i--)
#define F first
#define S second
#define ll long long

const int INF = 1e9;
const long long LLINF = 1e18;

using namespace std;

int dy[] = {0,1,0,-1};
int dx[] = {1,0,-1,0};
int dy8[] = {0,1,1,1,0,-1,-1,-1};
int dx8[] = {1,1,0,-1,-1,-1,0,1};

/*==================================================*/
/*variable*/
int N, M;
int A[10010], B[10010], X[1010], Y[1010];

int d[10010];
/*==================================================*/
/*function*/

/*==================================================*/

int main() {
    cin>>N;
    REP(i,0,N){
        cin>>A[i]>>B[i];
    }

    int mx = 0;
    cin>>M;
    REP(i,0,M) {
        cin>>X[i]>>Y[i];
        int cnt = 0;
        REP(j,0,N){
            if(X[i] <= A[j] && Y[i] >= B[j]) cnt++;
        }
        d[i] = cnt;
        mx = max(mx, cnt);
    }

    if(mx != 0){
        REP(i,0,M){
            if(d[i] == mx) cout<<i+1<<endl;
        }
    }else{
        cout<<0<<endl;
    }


    return 0;
}