#include <bits/stdc++.h>
using namespace std;
bool comp(string a, string b) {
  if (a.size() < b.size())
    return true;
  else if (a.size() == b.size()) {
    if (a < b)
      return true;
    else
      return false;
  } else
    return false;
}
void solve() {
  long long n;
  cin >> n;
  vector<string> v(n), s(n);
  for (long long i = 0; i < n; i++) {
    cin >> v[i];
  }
  for (long long i = 0; i < n; i++) cin >> s[i];
  sort((s).begin(), (s).end(), comp);
  sort((v).begin(), (v).end(), comp);
  long long ans = 0;
  for (long long i = 0; i < n; i++) {
    auto it1 = find(s.begin() + i, s.end(), v[i]);
    auto it2 = find(v.begin() + i, v.end(), s[i]);
    if (it1 != s.end()) {
      string p = s[i];
      s[i] = v[i];
      *it1 = p;
    } else if (it2 != v.end()) {
      string p = v[i];
      v[i] = s[i];
      *it2 = p;
    } else {
      if (s[i] != v[i]) {
        s[i] = v[i];
        ans++;
      }
    }
  }
  cout << ans;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long q = 1;
  while (q--) {
    solve();
  }
  return 0;
}
