#include <bits/stdc++.h>
using namespace std;
int dcmp(long double n, long double y) {
  return fabs(n - y) <= 1e-9 ? 0 : n < y ? -1 : 1;
}
bool taken[200], vis[200];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int n;
  cin >> n;
  priority_queue<pair<int, pair<int, int>>, vector<pair<int, pair<int, int>>>,
                 greater<pair<int, pair<int, int>>>>
      q;
  string a[n];
  string b[n];
  int ans = 0;
  for (int i = 0; i < (int)(n); ++i) {
    cin >> a[i];
  }
  for (int i = 0; i < (int)(n); ++i) {
    cin >> b[i];
  }
  for (int i = 0; i < (int)(n); ++i) {
    for (int j = 0; j < (int)(n); ++j) {
      if (a[i].size() != b[j].size()) continue;
      int cnt = 0;
      for (int k = 0; k < ((int)((a[i]).size())); ++k) {
        if (a[i][k] != b[j][k]) cnt++;
      }
      q.push({cnt, {i, j}});
    }
  }
  while (q.size()) {
    pair<int, pair<int, int>> top = q.top();
    q.pop();
    if ((!vis[top.second.first]) && (!taken[top.second.second])) {
      ans += top.first;
      vis[top.second.first] = 1;
      taken[top.second.second] = 1;
    }
  }
  cout << ans << '\n';
}
