nw = int(input())
W = list(map(int, input().split()))
nb = int(input())
B = list(map(int, input().split()))

W.sort(reverse=True)
B.sort(reverse=True)
Wc = W[:]
Bc = B[:]

res = 1
l = W[0]
iw, ib = 1, 0
white = False
while True:
    if white:
        while iw < nw:
            ll = W[iw]
            if ll < l:
                break
            iw += 1
        if iw == nw:
            break
        l = ll
        res += 1
        white = False
    else:
        while ib < nb:
            ll = B[ib]
            if ll < l:
                break
            ib += 1
        if ib == nb:
            break
        l = ll
        res += 1
        white = True
ans = res

res = 1
l = B[0]
iw, ib = 0, 1
white = True
while True:
    if white:
        while iw < nw:
            ll = W[iw]
            if ll < l:
                break
            iw += 1
        if iw == nw:
            break
        l = ll
        res += 1
        white = False
    else:
        while ib < nb:
            ll = B[ib]
            if ll < l:
                break
            ib += 1
        if ib == nb:
            break
        l = ll
        res += 1
        white = True
ans = max(ans, res)
print(ans)