from itertools import product
Nw = int(input())
W = list(map(int,input().split()))
Nb = int(input())
B = list(map(int,input().split()))
hmax = 0
for x in product((0,1),repeat=Nw):
    D = []
    for i in range(Nw):
        if x[i]==1:
            D.append(W[i])
    D = sorted(D,reverse=True)
    for y in product((0,1),repeat=Nb):
        if abs(sum(x)-sum(y))>1:continue
        if sum(x)+sum(y)==0:continue
        E = []
        for j in range(Nb):
            if y[j]==1:
                E.append(B[j])
        E = sorted(E,reverse=True)
        if len(D)>len(E):
            flag = 0
            for i in range(len(D)-1):
                if D[i]>E[i]>D[i+1]:continue
                flag = 1
                break
            if flag==0:
                h = len(D)+len(E)
                hmax = max(hmax,h)
        elif len(E)>len(D):
            flag = 0
            for i in range(len(E)-1):
                if E[i]>D[i]>E[i+1]:continue
                flag = 1
                break
            if flag==0:
                h = len(E)+len(D)
                hmax = max(hmax,h)
        else:
            if D[0]>E[0]:
                flag = 0
                for i in range(len(D)-1):
                    if D[i]>E[i]>D[i+1]:continue
                    flag = 1
                    break
                if flag==0 and D[-1]>E[-1]:
                    h = len(D)+len(E)
                    hmax = max(hmax,h)
            elif E[0]>D[0]:
                flag = 0
                for i in range(len(E)-1):
                    if E[i]>D[i]>E[i+1]:continue
                    flag = 1
                    break
                if flag==0 and E[-1]>D[-1]:
                    h = len(D)+len(E)
                    hmax = max(hmax,h)
print(hmax)