n_w = int(input())
w_blocks = [int(i) for i in input().split()]
n_b = int(input())
b_blocks = [int(i) for i in input().split()]

w_blocks.sort(reverse=True)
b_blocks.sort(reverse=True)

def solve(col, size):
    if col == 'w':
        for w in w_blocks:
            if w < size:
                return solve('b', w) + 1
    else:
        for b in b_blocks:
            if b < size:
                return solve('w', b) + 1

    return 0
w_start = solve('w', 21)
b_start = solve('b', 21)

print(max(w_start, b_start))