#include <bits/stdc++.h>
using namespace std;
struct p {
  int x, y, dis, cn;
} c[100001];
int n, m, s, t = 5000, num, tot, tot1;
int h[5001], d1[5001], pre[5001];
bool use[5001], use1[5001];
int D[101][101];
string a[101], b[101], aa[101], bb[101];
int main() {
  cin >> n;
  memset(D, 1, sizeof(D));
  for (int i = 1; i <= n; ++i) cin >> a[i];
  sort(a + 1, a + 1 + n);
  for (int i = 1; i <= n; ++i) cin >> b[i];
  sort(b + 1, b + 1 + n);
  for (int i = 1; i <= n; ++i)
    for (int j = 1; j <= n; ++j)
      if (a[i] == b[j] && !use[i] && !use1[j]) use[i] = use1[j] = 1;
  for (int i = n; i >= 1; --i) {
    if (!use[i]) aa[++tot] = a[i];
    if (!use1[i]) bb[++tot1] = b[i];
  }
  int ans = 0;
  for (int i = 1; i <= tot; ++i)
    if (aa[i] != bb[i]) ++ans;
  cout << ans << endl;
  return 0;
}
