import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.BufferedWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author Rishabhdeep Singh
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        TaskA solver = new TaskA();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskA {
        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int n = in.nextInt();
            int[] cnt = new int[10];
            Arrays.fill(cnt, 0);
            List<String> a = new ArrayList<>();
            for (int i = 0; i < n; i++) {
                a.add(in.readLine());
            }
            List<String> b = new ArrayList<>();
            for (int i = 0; i < n; i++) {
                String temp = in.readLine();
                if (a.contains(temp)) {
                    a.remove(temp);
                } else
                    b.add(temp);
            }
            int[] cnta = new int[10];
            for (int i = 0; i < a.size(); i++) {
                cnta[a.get(i).length()]++;
            }
            int[] cntb = new int[10];
            Arrays.fill(cnta, 0);
            Arrays.fill(cntb, 0);
            for (int i = 0; i < b.size(); i++) {
                cntb[a.get(i).length()]++;
            }
            int ans = 0;
            for (int i = 0; i < 10; i++) {
                ans += Math.abs(cnta[i] - cntb[i]);
            }
            out.println(ans);
        }

   ... What is the time complexity of the previous code?