# -*- coding: utf-8 -*-
"""
No.110 しましまピラミッド
https://yukicoder.me/problems/no/110

"""
import sys
from sys import stdin
from bisect import bisect_left
input = stdin.readline


def solve(white_blocks, black_blocks):
    white_blocks.append(-1)
    white_blocks.sort()
    black_blocks.append(-1)
    black_blocks.sort()
    
    WHITE, BLACK = 0, 1
    blocks = [white_blocks, black_blocks]

    # 白いブロックを最初に使う場合
    ans_w = [white_blocks[-1]]
    next_block = BLACK
    while True:
        i = bisect_left(blocks[next_block], ans_w[-1])
        if blocks[next_block][i-1] == -1:
            break
        ans_w.append(blocks[next_block][i-1])
        next_block = BLACK if next_block == WHITE else WHITE

    # 黒いブロックを最初に使う場合
    ans_b = [black_blocks[-1]]
    next_block = WHITE
    while True:
        i = bisect_left(blocks[next_block], ans_b[-1])
        if blocks[next_block][i-1] == -1:
            break
        ans_b.append(blocks[next_block][i-1])
        next_block = BLACK if next_block == WHITE else WHITE

    return max(len(ans_w), len(ans_b))


def main(args):
    nw = int(input())
    white_blocks = [int(x) for x in input().split()]
    nb = int(input())
    black_blocks = [int(x) for x in input().split()]

    ans = solve(white_blocks, black_blocks)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])