import java.io.*;
import java.util.*;

public class TaskA
{
	public static void main(String[] args)
	{
		new TaskA(System.in, System.out);
	}

	static class Solver implements Runnable
	{
		int n;
		String[] last, curr;
		BufferedReader in;
		PrintWriter out;

		void solve() throws IOException
		{
			n = Integer.parseInt(in.readLine());
			last = new String[n];
			curr = new String[n];

			for (int i = 0; i < n; i++)
				last[i] = in.readLine();

			for (int i = 0; i < n; i++)
				curr[i] = in.readLine();

			int changes = 0;
			String[] sizes = new String[]{"S", "M", "L", "XS", "XXS", "XXXS", "XL", "XXL", "XXXL"};
			int[] old = count(last, sizes);
			int[] now = count(curr, sizes);

			for (int i= 0; i < sizes.length; i++)
			{
				changes += Math.abs(old[i] - now[i]);
			}

			out.println(changes / 2);

/*			if (now[0] > old[0])
			{
				int add = now[0] - old[0];

				changes += add;


			}*/
		}

		int[] count(String[] s, String[] sizes)
		{
			int len = sizes.length;
			int[] cnt = new int[len];

			for (int i = 0; i < len; i++)
			{
				for (String str : s)
				{
					if (str.equals(sizes[i]))
						cnt[i]++;
				}
			}

			return cnt;
		}

		void debug(Object... o)
		{
			System.err.println(Arrays.deepToString(o));
		}

		public Solver(BufferedReader in, PrintWriter out)
		{
			this.in = in;
			this.out = out;
		}

		@Override
		public void run()
		{
			try
			{
				solve();
			}
			catch (IOException e)
			{
				e.printStackTrace();
			}
		}

	}

	static class CMath
	{
		static long power(long number, long power)
		{
			if (number == 1 || number == 0 || power == 0)
				return 1;

			if (power == 1)
				return number;

			if (power % 2 == 0)
				return power(number * number, power / 2);
			else
				return power(number * number, power / 2) * number;
		}

		static long modPower(long number, long power, long mod)
		{
			if (number == 1 || number == 0 || power == 0)
				return 1;

			number = mod(number, mod);

			if (power == 1)
				return number;

			long square = mod(number * number, mod);

			if (power... What is the time complexity of the previous code?