#include <bits/stdc++.h>
using namespace std;
const int TAM = 1e5 + 5;
int n;
vector<string> arr, fin;
bool cmp(string a, string b) {
  if (a.size() != b.size()) return a.size() < b.size();
  return a < b;
}
int dif(string a, string b) {
  int ret = 0;
  for (int i = 0; i < a.size(); i++) {
    if (a[i] != b[i]) ret++;
  }
  return ret;
}
map<char, int> pos;
int last(string s) { return pos[s[s.size() - 1]]; }
int tms[5][4];
int tmb[5][4];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  pos['S'] = 0;
  pos['M'] = 1;
  pos['L'] = 2;
  string x;
  cin >> n;
  for (int i = 0; i < n; i++) {
    cin >> x;
    tms[x.size()][last(x)]++;
  }
  for (int i = 0; i < n; i++) {
    cin >> x;
    tmb[x.size()][last(x)]++;
  }
  int ans = 0;
  for (int i = 1; i < 5; i++) {
    int cr = abs(tms[i][0] - tmb[i][0]) + abs(tms[i][1] - tmb[i][1]) +
             abs(tms[i][2] - tmb[i][2]);
    cr /= 2;
    ans += cr;
  }
  cout << ans << endl;
  return 0;
}
