#include <bits/stdc++.h>
int main() {
  int n, l, temp, step, c = 0, c1 = 0, c2 = 0, c3 = 0, c4 = 0, c5 = 0, c6 = 0,
                        c7 = 0, c8 = 0, c9 = 0, c10 = 0, c11 = 0, c12 = 0,
                        c13 = 0, c14 = 0, c15 = 0, c16 = 0, c17 = 0, c18 = 0;
  scanf("%d", &n);
  int a[n], b[n], i, j, p = 0, fre[100];
  char t[100];
  char s1[200][4], s2[200][4],
      s3[10][10] = {"S", "M", "XL", "XS", "XXL", "XXS", "XXXL", "XXXS", "L"};
  for (i = 0; i < n; i++) {
    scanf("%s", s1[i]);
    a[i] = strlen(s1[i]);
    if (strcmp(s1[i], s3[0]) == 0) {
      c1++;
    } else if (strcmp(s1[i], s3[1]) == 0) {
      c2++;
    } else if (strcmp(s1[i], s3[2]) == 0) {
      c3++;
    } else if (strcmp(s1[i], s3[3]) == 0) {
      c4++;
    } else if (strcmp(s1[i], s3[4]) == 0) {
      c5++;
    } else if (strcmp(s1[i], s3[5]) == 0) {
      c6++;
    } else if (strcmp(s1[i], s3[6]) == 0) {
      c7++;
    } else if (strcmp(s1[i], s3[7]) == 0) {
      c8++;
    } else if (strcmp(s1[i], s3[8]) == 0) {
      c17++;
    }
  }
  for (i = 0; i < n; i++) {
    scanf("%s", s2[i]);
    b[i] = strlen(s2[i]);
    if (strcmp(s2[i], s3[0]) == 0) {
      c9++;
    } else if (strcmp(s2[i], s3[1]) == 0) {
      c10++;
    } else if (strcmp(s2[i], s3[2]) == 0) {
      c11++;
    } else if (strcmp(s2[i], s3[3]) == 0) {
      c12++;
    } else if (strcmp(s2[i], s3[4]) == 0) {
      c13++;
    } else if (strcmp(s2[i], s3[5]) == 0) {
      c14++;
    } else if (strcmp(s2[i], s3[6]) == 0) {
      c15++;
    } else if (strcmp(s2[i], s3[7]) == 0) {
      c16++;
    } else if (strcmp(s2[i], s3[8]) == 0) {
      c18++;
    }
  }
  if (c9 > c1) {
    c += (c9 - c1);
  }
  if (c10 > c2) {
    c += (c10 - c2);
  }
  if (c11 > c3) {
    c += (c11 - c3);
  }
  if (c12 > c4) {
    c += (c12 - c4);
  }
  if (c13 > c5) {
    c += (c13 - c5);
  }
  if (c14 > c6) {
    c += (c14 - c6);
  }
  if (c15 > c7) {
    c += (c15 - c7);
  }
  if (c16 > c8) {
    c += (c16 - c8);
  }
  if (c18 > c17) {
    c += (c18 - c17);
  }
  printf("%d\n", c);
  return 0;
}
