#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>


int descending_compare(const void *a, const void *b){
    if (*(long long*)a > *(long long*)b){
        return -1;
    }else if (*(long long*)a == *(long long*)b){
        return 0;
    }else{
        return 1;
    }
}

int ascending_compare(const void *a, const void *b){
    if (*(int*)a < *(int*)b){
        return -1;
    }else if (*(int*)a == *(int*)b){
        return 0;
    }else{
        return 1;
    }
}


int lower_bound(int *a, int n, int key){
    int left, mid, right;
    left = 0, right = n;
    mid = (left + right)/2;
    while ((left+1 != mid || mid+1 != right) && mid != left){
        if (key > a[mid]){
            left = mid;
        }else{
            right = mid+1;
        }
        mid = (left + right)/2;
    }
    if (a[left] >= key)return left;
    if (a[mid] >= key)return mid;
    if (a[right] >= key)return right;
    return n;
}

//greatest common divisor
unsigned long  gcd(unsigned long x, unsigned long y){
    if (y == 0){ 
        return x;
    }else if (x > y){
        return gcd(y, x % y);
    }else{
        return gcd(x, y % x);
    }
}



long long factorial(int x){
    long long rtn = 1;
    int i;
    for (i = x; i > 1; i--){
        rtn = (rtn*i);
    }
    return rtn;
}

/*
int struct_ascending_compare(const void *p, const void *q) {
    return ((struct_name*)p)->member_name - ((struct_name*)q)->member_name;
}*/

int a[10005];
int b[10005];
int x[1005];
int y[1005];
int mentaiko[1005] = {0};

int main(void){
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++){
        scanf("%d %d", &a[i], &b[i]);
    }
    int m;
    scanf("%d", &m);
    for (int i = 0; i < m; i++){
        scanf("%d %d", &x[i], &y[i]);
    }

    for (int i = 0; i < n; i++){
        for (int j = 0; j < m; j++){
            if (x[j] <= a[i] && y[j] >= b[i]){
                mentaiko[j]++;
            }
        }
    }
    int max = -1;
    for (int i = 0; i < m; i++){
        if (max < mentaiko[i]){
            max = mentaiko[i];
        }
    }
    if (max == 0){
        printf("0\n");
        return 0;
    }
    int ans = 0;
    for (int i = 0; i < m; i++){
        if (mentaiko[i] == max){
            printf("%d\n", i+1);
        }
    }
    return 0;




}