Nw = int(input())
W = [int(i) for i in input().split()]
Nb = int(input())
B = [int(i) for i in input().split()]

W.sort(reverse=True)
B.sort(reverse=True)

ans = 1

tmp = 1
max_l = W[0]
flag = True
switch = 1
lw, lb = 0, 0

while flag:
    if switch == 0:
        for i in range(lw, Nw):
            if W[i] < max_l:
                max_l = W[i]
                switch ^= 1
                tmp += 1
                lw = i + 1
                break
        else:
            flag = False
    else:
        for i in range(lb, Nb):
            if B[i] < max_l:
                max_l = B[i]
                switch ^= 1
                tmp += 1
                lb = i + 1
                break
        else:
            flag = False

ans = max(ans, tmp)

max_l = B[0]
flag = True
switch = 0
lw, lb = 0, 0
tmp = 1

while flag:
    if switch == 0:
        for i in range(lw, Nw):
            if W[i] < max_l:
                max_l = W[i]
                switch ^= 1
                tmp += 1
                lw = i + 1
                break
        else:
            flag = False
    else:
        for i in range(lb, Nb):
            if B[i] < max_l:
                max_l = B[i]
                switch ^= 1
                tmp += 1
                lb = i + 1
                break
        else:
            flag = False

ans = max(ans, tmp)

print(ans)