import java.io.*;
import java.util.*;
/*
 * Heart beats fast
 * 		Colors and promises
 * 			How to be brave
 * 				How can I love when I am afraid...
 */
//read the question correctly (is y a vowel? what are the exact constraints?)
//look out for SPECIAL CASES (n=1?) and overflow (ll vs int?)
//always declare multidimensional arrays as [2][n] not [n][2]
//it can lead to upto 2-3x diff in runtime
//declare int/long tries with 16 array size due to object overhead :D
public class Main
{
	
	public static void main(String[] args) throws Exception
	{
		int n=ni();
		Map<String, Integer> hola=new HashMap<String,Integer>();
		hola.put("S", 0);
		hola.put("XS", 0);
		hola.put("XXS", 0);
		hola.put("XXXS", 0);
		hola.put("M", 0);
		hola.put("L", 0);
		hola.put("XL", 0);
		hola.put("XXL", 0);
		hola.put("XXXL", 0);
		for(int i=0; i<n; i++)
		{
			String te=ns();
			hola.put(te,hola.get(te)+1);
		}
		for(int i=0; i<n; i++)
		{
			String te=ns();
			hola.put(te,hola.get(te)-1);
		}
		int ans=0;
		for(int te:hola.values())
		{
			ans+=max(te,0);
		}
		pr(ans);
		System.out.print(output);
	}
	///////////////////////////////////////////
	///////////////////////////////////////////
	///template from here
	static int pow(int a, int b)
	{
		int c=1;
		while(b>0)
		{
			if(b%2!=0)
				c*=a;
			a*=a;
		}
		return c;
	}
	static class pair
	{
		int a, b;
		pair(){}
		pair(int c,int d){a=c;b=d;}
	}
	static interface combiner
	{
		public long combine(long a,long b);
	}
	static final long mod=1000000007;
	static final double eps=1e-9;
	static final long inf=100000000000000000L;
	static Reader in=new Reader();
	static StringBuilder output=new StringBuilder();
	static Random rn=new Random();
	static void reverse(int[]a){for(int i=0; i<a.length/2; i++){a[i]^=a[a.length-i-1];a[a.length-i-1]^=a[i];a[i]^=a[a.length-i-1];}}
	static void sort(int[]a)
	{
		int te;
		for(int i=0; i<a.length; i+=2)
		{
			te=rn.nextInt(a.length);
			if(i!=te)
			{
				a[i]^=a[te];
				a[te]^=a[i];
				a[i]^=a[te];
			}
		}
		Arrays.sort(a);
	}
	static void... Which one is the correct time complexity of the code snippet: constant, linear, quadratic, cubic, log(n), nlog(n) or NP-hard?