# No.110 しましまピラミッド
from bisect import bisect_right as bs


def make_pyramid(A, B):
    cur, ret = 0, 0
    N, M = len(A), len(B)
    memo_a, memo_b = 0, 0
    while True:  # top: ABAB...
        idx = bs(A, cur)
        if idx == N:
            break
        cur, ret = A[idx], ret + 1

        idx = bs(B, cur)
        if idx == M:
            break
        cur, ret = B[idx], ret + 1
    return ret


def main():
    _ = input()
    W = sorted(map(int, input().split()))
    _ = input()
    B = sorted(map(int, input().split()))
    ans = max(make_pyramid(W, B), make_pyramid(B, W))
    print(ans)


if __name__ == "__main__":
    main()