#include <bits/stdc++.h>
using namespace std;
vector<string> split(const string &s, char c) {
  vector<string> v;
  stringstream ss(s);
  string x;
  while (getline(ss, x, c)) v.emplace_back(x);
  return move(v);
}
template <typename T, typename... Args>
inline string arrStr(T arr, int n) {
  stringstream s;
  s << "[";
  for (int i = 0; i < n - 1; i++) s << arr[i] << ",";
  s << arr[n - 1] << "]";
  return s.str();
}
inline void __evars_begin(int line) { cerr << "#" << line << ": "; }
template <typename T>
inline void __evars_out_var(vector<T> val) {
  cerr << arrStr(val, val.size());
}
template <typename T>
inline void __evars_out_var(T *val) {
  cerr << arrStr(val, 10);
}
template <typename T>
inline void __evars_out_var(T val) {
  cerr << val;
}
inline void __evars(vector<string>::iterator it) { cerr << endl; }
template <typename T, typename... Args>
inline void __evars(vector<string>::iterator it, T a, Args... args) {
  cerr << it->substr((*it)[0] == ' ', it->length()) << "=";
  __evars_out_var(a);
  cerr << "; ";
  __evars(++it, args...);
}
const long long nmax = 1000 * 1007;
struct edge {
  long long a, b, cost;
  edge(long long x, long long y, long long z) : a(x), b(y), cost(z){};
};
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long A, B, C;
map<string, long long> mp;
map<pair<long long, long long>, long long> like;
pair<long long, long long> check(vector<long long> &a, vector<long long> &b,
                                 vector<long long> &c) {
  long long tmp_like = 0, cnt_a = 0, cnt_b = 0, cnt_c = 0;
  cnt_a = A / a.size(), cnt_b = B / b.size(), cnt_c = C / c.size();
  for (long long i = 0; i < (long long)(a.size()); i++) {
    for (long long j = 0; j < (long long)(a.size()); j++) {
      if (like[{a[i], a[j]}]) tmp_like++;
    }
  }
  for (long long i = 0; i < (long long)(b.size()); i++) {
    for (long long j = 0; j < (long long)(b.size()); j++) {
      if (like[{b[i], b[j]}]) tmp_like++;
    }
  }
  for (long long i = 0; i < (long long)(c.size()); i++) {
    for (long long j = 0; j < (long long)(c.size()); j++) {
      if (like[{c[i], c[j]}]) tmp_like++;
    }
  }
  return {max({cnt_a, cnt_b, cnt_c}) - min({cnt_a, cnt_b, cnt_c}), tmp_like};
}
pair<long long, long long> fn(long long i, long long j, long long k) {
  vector<long long> v = {0, 1, 2, 3, 4, 5, 6};
  pair<long long, long long> res;
  res.first = 1e12;
  do {
    long long x = 0;
    vector<long long> a, b, c;
    while (x < i) {
      a.push_back(v[x]);
      x++;
    }
    while (x < i + j) {
      b.push_back(v[x]);
      x++;
    }
    while (x < i + j + k) {
      c.push_back(v[x]);
      x++;
    }
    pair<long long, long long> ans = check(a, b, c);
    if (res.first > ans.first) {
      res = ans;
    } else if (res.first == ans.first && res.second < ans.second)
      res = ans;
  } while (next_permutation((v).begin(), (v).end()));
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  mp["Anka"] = 0;
  mp["Chapay"] = 1;
  mp["Cleo"] = 2;
  mp["Troll"] = 3;
  mp["Dracul"] = 4;
  mp["Snowy"] = 5;
  mp["Hexadecimal"] = 6;
  long long n;
  cin >> n;
  pair<long long, long long> res;
  res.first = 1e12;
  for (long long i = 0; i < (long long)(n + 1); i++) {
    string s, tmp = "";
    getline(cin, s);
    if (!i) continue;
    s = s + " ";
    vector<string> v;
    long long cnt = 0;
    for (long long i = 0; i < (long long)(s.length()); i++) {
      if (s[i] == ' ') {
        v.push_back(tmp);
        tmp = "";
      } else
        tmp = tmp + s[i];
    }
    string a = v[0], b = v[2];
    like[{mp[a], mp[b]}]++;
  }
  cin >> A >> B >> C;
  for (long long i = (long long)(1); i <= (long long)(8); i++) {
    for (long long j = (long long)(1); j <= (long long)(8); j++) {
      long long k = 7 - i - j;
      if (k <= 0) break;
      pair<long long, long long> ans = fn(i, j, k);
      if (res.first > ans.first)
        res = ans;
      else if (res.first == ans.first && res.second < ans.second)
        res = ans;
    }
  }
  cout << res.first << " " << res.second << endl;
  return 0;
}
