package main

import (
	"bufio"
	"fmt"
	"os"
)

func abs(x int) int {
	if x < 0 {
		return -x
	}
	return x
}

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Scan()
	n := 0
	fmt.Sscanf(scanner.Text(), "%d", &n)

	var prevM, prevS, prevL int
	var prevXS, prevXL int
	var prevXXS, prevXXL int
	var prevXXXS, prevXXXL int

	for i := 0; i < n; i++ {
		scanner.Scan()
		s := scanner.Text()
		switch s {
		case "M":
			prevM++
		case "S":
			prevS++
		case "L":
			prevL++
		case "XS":
			prevXS++
		case "XL":
			prevXL++
		case "XXS":
			prevXXS++
		case "XXL":
			prevXXL++
		case "XXXS":
			prevXXXS++
		case "XXXL":
			prevXXXL++
		}
	}

	var currM, currS, currL int
	var currXS, currXL int
	var currXXS, currXXL int
	var currXXXS, currXXXL int

	for i := 0; i < n; i++ {
		scanner.Scan()
		s := scanner.Text()
		switch s {
		case "M":
			currM++
		case "S":
			currS++
		case "L":
			currL++
		case "XS":
			currXS++
		case "XL":
			currXL++
		case "XXS":
			currXXS++
		case "XXL":
			currXXL++
		case "XXXS":
			currXXXS++
		case "XXXL":
			currXXXL++
		}
	}

	cost := 0
	cost += (abs(prevM-currM) + abs(prevS-currS) + abs(prevL-currL)) / 2
	cost += abs(prevXS - currXS)
	cost += abs(prevXXS - currXXS)
	cost += abs(prevXXXS - currXXXS)

	fmt.Println(cost)
}