#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10, M = 1e5 + 3;
const double Pi = acos(-1.0);
string a[105];
string b[105];
struct node {
  int v;
  int x, y;
} c[105 * 105];
bool cmp(node n, node m) { return n.v < m.v; }
int v1[105], v2[105];
int main() {
  ios::sync_with_stdio(false);
  int n;
  cin >> n;
  for (int i = 1; i <= n; i++) cin >> a[i];
  for (int i = 1; i <= n; i++) cin >> b[i];
  int t = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (a[i].size() == b[j].size()) {
        int num = 0;
        for (int k = 0; k < (int)a[i].size(); k++) {
          if (a[i][k] != b[j][k]) num++;
        }
        c[++t].v = num;
        c[t].x = i;
        c[t].y = j;
      }
    }
  }
  sort(c + 1, c + t + 1, cmp);
  int ans = 0;
  memset(v1, 0, sizeof(v1));
  memset(v2, 0, sizeof(v2));
  for (int i = 1; i <= t; i++) {
    if (v1[c[i].x]) continue;
    if (v2[c[i].y]) continue;
    ans += c[i].v;
    v1[c[i].x] = 1;
    v2[c[i].y] = 1;
  }
  cout << ans << endl;
}
