#include <bits/stdc++.h>
using namespace std;
int f[105][105];
string sa[105], sb[105];
void solve() {
  int n;
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> sa[i];
  }
  sort(sa + 1, sa + n + 1);
  for (int i = 1; i <= n; ++i) {
    cin >> sb[i];
  }
  sort(sb + 1, sb + n + 1);
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= n; ++j) {
      f[i][j] = max(f[i - 1][j], f[i][j - 1]);
      if (sa[i] == sb[j]) f[i][j] = max(f[i][j], f[i - 1][j - 1] + 1);
    }
  }
  cout << n - f[n][n];
}
int main() { solve(); }
