sdfas

def bs(k1, k2, m) :
    global k
    c = 0
    if m[c] == k[len(k)//2] :
        return len(k)//2
    elif m[c] < k[len(k)//2] :
        return bs(k1, k[len(k)//2], m)
        c += 1
    else :
        return bs(k[len(k)//2], k2, m)
        c += 1 
n = int(input())
for i in range(n) :
    k = list(map(int, input().split()))
c = int(input())
for j in range(n) :
    m = list(map(int, input().split()))
bs(k[0], k[-1], m)