#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}

long long mod_exp(long long b, long long e, long long m) {
    if (e > 0 && b == 0) return 0;
    long long ans = 1;
    b %= m;

    while (e > 0) {
        if ((e & 1LL)) ans = (ans * b) % m;
        e = e >> 1LL;
        b = (b * b) % m;
    }

    return ans;
}


int main()
{

    int Q;
    Q = 1;
    //cin >> Q;
    
    while (Q--) {
        
        int n;
        cin >> n;
        vector<int>x(n), y(n);
        for (int i = 0; i < n; i++)cin >> x[i] >> y[i];
        int m;
        cin >> m;
        int ans = 0; vector<int> t;
        for (int i = 0; i < m; i++) {
            int a, b;
            cin >> a >> b;
            int r = 0;
            for (int j = 0; j < n; j++) {
                if (a > x[j])continue;
                if (b < y[j])continue;
                r++;
            }
            if (ans < r) {
                t.clear();
                t.push_back(i + 1);
            }
            if (ans == r&&r)t.push_back(i + 1);
            ans = max(ans, r);
            
        }
        if (t.size())
            for (int i = 0; i < t.size(); i++)cout << t[i] << endl;
        else cout << 0;
    }

    return 0;
}