def check(s, t):
    for i in range(len(s)):
        if t[i] <= s[i]:
            return False
        if s[i] <= t[i+1]:
            return False
    return True

N = int(input())
W = list(map(int,input().split()))
M = int(input())
B = list(map(int,input().split()))
W.sort(reverse=True)
B.sort(reverse=True)
ans = 0
for bit_w in range(1<<N):
    for bit_b in range(1<<M):
        if abs(bin(bit_w).count('1') - bin(bit_b).count('1')) > 1:
            continue
        s = []
        t = []
        for i in range(N):
            if bit_w & (1<<i):
                s.append(W[i])
        for i in range(M):
            if bit_b & (1<<i):
                t.append(B[i])
        if len(s) == len(t):
            if check(s, [100] + t) or check(t, [100] + s):
                ans = max(ans, len(s)*2)
        else:
            if len(s) > len(t):
                s,t = t,s
            if check(s, t):
                ans = max(ans, len(s)*2+1)
print(ans)