#piramid
N=[0]*2
N[0]=int(input())
W=[int(i) for i in input().split()]
N[1]=int(input())
B=[int(i) for i in input().split()]
W.sort(reverse=True)
B.sort(reverse=True)
WB=[W,B]
F=0
for i in range(2):
    p=[0]*2
    H=1
    R=WB[i][0]
    j=i+1
    j%=2
    nd=0
    k=0
 #   print(k)
    while nd==0:
  #      print ("j")
    #    print (j)
        while k<N[j] and WB[j][k]>=R:
    #        print ("k2")
     #       print(WB[j][k])
            k+=1  
    #    print(k)
   #     print("k")
  #      a=0
    #    if k==N[j] and WB[j][k-1]<R:
     #       a=1
        if k<N[j] and WB[j][k]<R:
     #       a=1
    #    if a==1:
            H+=1
    #        print("k1")
        #    print (H)
            R=WB[j][k]
       #     print (R)
            p[j]=k
            j+=1
            j%=2
            k=p[j]+1
    #        print(k)
        else:
            nd=1
 #   print (H)
    if H>F: 
        F=H
print(F)