Nw=int(raw_input())
W=map(int,raw_input().split())
Nb=int(raw_input())
B=map(int,raw_input().split())
W.sort()
B.sort()
wi=Nw-1
bi=Nb-1
cur=W[Nw-1]
ansW=1
while True:
    if ansW%2==1:
        while bi>=0 and cur<=B[bi]:
            bi-=1
        if bi<0:
            break
        cur=B[bi]
        ansW+=1
    else:
        while wi>=0 and cur<=W[wi]:
            wi-=1
        if wi<0:
            break
        cur=W[wi]
        ansW+=1
wi=Nw-1
bi=Nb-1
cur=B[Nb-1]
ansB=1
while True:
    if ansB%2==0:
        while bi>=0 and cur<=B[bi]:
            bi-=1
        if bi<0:
            break
        cur=B[bi]
        ansB+=1
    else:
        while wi>=0 and cur<=W[wi]:
            wi-=1
        if wi<0:
            break
        cur=W[wi]
        ansB+=1
print max(ansW,ansB)