package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

func out(x ...interface{}) {
	fmt.Println(x...)
}

var sc = bufio.NewScanner(os.Stdin)

func getInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getInt()
	}
	return ret
}

func getString() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

func abs(a int) int {
	if a >= 0 {
		return a
	}
	return -a
}

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

func main() {
	sc.Split(bufio.ScanWords)
	Nw := getInt()
	w := getInts(Nw)
	Nb := getInt()
	b := getInts(Nb)

	sort.Slice(w, func(i, j int) bool {
		return w[i] > w[j]
	})
	sort.Slice(b, func(i, j int) bool {
		return b[i] > b[j]
	})

	l := 1000
	i, j := 0, 0
	cnt0 := 0
LOOP0:
	for {
		if i == Nb {
			break
		}
		for b[i] >= l {
			i++
			if i == Nb {
				break LOOP0
			}
		}
		l = b[i]
		i++
		cnt0++
		if j == Nw {
			break
		}
		for w[j] >= l {
			j++
			if j == Nw {
				break LOOP0
			}
		}
		l = w[j]
		j++
		cnt0++
	}

	l = 1000
	i, j = 0, 0
	cnt1 := 0
LOOP1:
	for {
		if j == Nw {
			break
		}
		for w[j] >= l {
			j++
			if j == Nw {
				break LOOP1
			}
		}
		l = w[j]
		j++
		cnt1++
		if i == Nb {
			break
		}
		for b[i] >= l {
			i++
			if i == Nb {
				break LOOP1
			}
		}
		l = b[i]
		i++
		cnt1++
	}

	out(max(cnt0, cnt1))
}