def solve(Bs, Ws, Nb, Nw):
    depth = 1
    idxW = 0
    idxB = 0
    while True:
        while Bs[idxB] >= Ws[idxW]:
            idxB += 1
            if idxB == Nb:
                return depth
        depth += 1
        while Ws[idxW] >= Bs[idxB]:
            idxW += 1
            if idxW == Nw:
                return depth
        depth += 1

Nw = int(input())
Ws = list(set(map(int, input().split())))
Nb = int(input())
Bs = list(set(map(int, input().split())))
Ws.sort(reverse=True)
Bs.sort(reverse=True)
if Bs[0] > Ws[0]:
    Bs, Ws = Ws, Bs
Nb = len(Bs)
Nw = len(Ws)
if Bs[0] == Ws[0]:
    print(max(solve(Bs, Ws, Nb, Nw), solve(Ws, Bs, Nw, Nb)))
else:
    print(solve(Bs, Ws, Nb, Nw))