import sys
readline=sys.stdin.readline

N=int(readline())
W=list(map(int,readline().split()))
M=int(readline())
B=list(map(int,readline().split()))
W.sort()
B.sort()
ans=0
for i in range(2):
    lst=[]
    WB=[[w for w in W],[b for b in B]]
    for j in range(100):
        ij=(i+j)%2
        while WB[ij] and lst and WB[ij][-1]>=lst[-1]:
            WB[ij].pop()
        if WB[ij] and (not lst or WB[ij][-1]<lst[-1]):
            lst.append(WB[ij].pop())
        else:
            break
    ans=max(ans,len(lst))
print(ans)