#include <bits/stdc++.h>
using namespace std;
long long mult(long long a, long long b, long long p = (int)(1e9 + 7)) {
  return ((a % p) * (b % p)) % p;
}
long long add(long long a, long long b, long long p = (int)(1e9 + 7)) {
  return (a % p + b % p) % p;
}
long long fpow(long long n, long long k, long long p = (int)(1e9 + 7)) {
  long long r = 1;
  for (; k; k >>= 1) {
    if (k & 1) r = r * n % p;
    n = n * n % p;
  }
  return r;
}
long long inv(long long a, long long p = (int)(1e9 + 7)) {
  return fpow(a, p - 2, p);
}
int main() {
  long long n;
  cin >> n;
  string s[n], s1[n];
  map<string, int> mp1, mp2, mp3;
  for (int i = 0; i < n; i++) {
    cin >> s[i];
    mp1[s[i]] += 1;
  }
  for (int i = 0; i < n; i++) {
    cin >> s1[i];
    mp2[s1[i]] += 1;
  }
  long long cnt = 0;
  for (int i = 0; i < n; i++) {
    int l = s[i].length();
    if (mp1[s[i]] and mp2[s[i]]) {
      mp1[s[i]] -= 1;
      mp2[s[i]] -= 1;
    } else {
      cnt += 1;
    }
  }
  cout << cnt;
  return 0;
}
