#include <bits/stdc++.h>
using namespace std;
const int INF = 0x3f3f3f3f;
const int MaxN = 100;
char a[MaxN + 5][MaxN + 5], b[MaxN + 5][MaxN + 5];
bool vis1[MaxN + 5], vis2[MaxN + 5];
int main() {
  int n;
  scanf("%d", &n);
  int cnt = 0;
  for (int i = 1; i <= n; i++) scanf("%s", a[i] + 1);
  for (int i = 1; i <= n; i++) scanf("%s", b[i] + 1);
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      int flag = 0;
      if (strlen(a[i] + 1) == strlen(b[j] + 1) && vis1[i] == 0 &&
          vis2[j] == 0) {
        for (int k = 1; k <= strlen(a[i] + 1); k++) {
          if (a[i][k] != b[j][k]) {
            flag = 1;
            break;
          }
        }
        if (flag == 0) {
          vis1[i] = 1;
          vis2[j] = 1;
          cnt++;
        }
        if (flag == 1) flag = 0;
      } else
        continue;
    }
  }
  printf("%d\n", n - cnt);
  return 0;
}
