from bisect import bisect_left
from itertools import count


def main():
    _ = int(input())
    W = list(map(int, input().split()))
    _ = int(input())
    B = list(map(int, input().split()))

    W.sort()
    B.sort()

    W_start_tower = [W[0]]
    B_start_tower = [B[0]]

    for idx in range(40):
        match idx % 2:
            case 0:
                B_idx = bisect_left(B, W_start_tower[-1]+1)
                if B_idx != len(B):
                    W_start_tower.append(B[B_idx])
                else:
                    break

            case 1:
                W_idx = bisect_left(W, W_start_tower[-1]+1)
                if W_idx != len(W):
                    W_start_tower.append(W[W_idx])
                else:
                    break

    for idx in range(40):
        match idx % 2:
            case 0:

                W_idx = bisect_left(W, B_start_tower[-1]+1)
                if W_idx != len(W):
                    B_start_tower.append(W[W_idx])
                else:
                    break

            case 1:
                B_idx = bisect_left(B, B_start_tower[-1]+1)
                if B_idx != len(B):
                    B_start_tower.append(B[B_idx])
                else:
                    break

    print(max(len(W_start_tower), len(B_start_tower)))


if __name__ == "__main__":
    main()