#include <bits/stdc++.h>
using namespace std;
int bc(unsigned long n) {
  n = n - ((n >> 1) & 033333333333) - ((n >> 2) & 011111111111);
  return ((n + (n >> 3)) & 030707070707) % 077;
}
int main(void) {
  int n;
  int likes[7][7];
  map<string, int> hero;
  for (int i = 0; i < 7; ++i) fill_n(likes[i], 7, 0);
  cin >> n;
  string p, q, s;
  for (int i = 0; i < n; ++i) {
    cin >> p >> s >> q;
    if (hero.find(p) == hero.end()) hero.insert(make_pair(p, hero.size()));
    if (hero.find(q) == hero.end()) hero.insert(make_pair(q, hero.size()));
    likes[hero[p]][hero[q]] = 1;
  }
  int a, b, c;
  cin >> a >> b >> c;
  int diff = INT_MAX;
  set<pair<int, pair<int, int> > > g;
  for (int i = 1; i <= 5; ++i)
    for (int j = 1; j <= 5; ++j)
      for (int k = 1; k <= 5; ++k)
        if (i + j + k == 7) {
          int tmp =
              max(a / i, max(b / j, c / k)) - min(a / i, min(b / j, c / k));
          if (diff > tmp) {
            g.erase(g.begin(), g.end());
            diff = tmp;
            g.insert(make_pair(i, make_pair(j, k)));
          } else if (diff == tmp) {
            g.insert(make_pair(i, make_pair(j, k)));
          }
        }
  int like = -INT_MAX;
  for (set<pair<int, pair<int, int> > >::iterator iter = g.begin();
       iter != g.end(); ++iter) {
    for (int i = 1; i < (1 << 7); ++i)
      if (bc(i) == iter->first)
        for (int j = 1; j < (1 << 7); ++j)
          if (bc(j) == iter->second.first && (i & j) == 0)
            for (int k = 1; k < (1 << 7); ++k)
              if (bc(k) == iter->second.second && (i & k) == 0 &&
                  (j & k) == 0) {
                int tmp = 0;
                for (int r = 0; r < 7; ++r) {
                  for (int c = 0; c < 7; ++c) {
                    if (r != c) {
                      int br = 1 << r, bc = 1 << c;
                      if (((i & br) != 0 && (i & bc) != 0) ||
                          ((j & br) != 0 && (j & bc) != 0) ||
                          ((k & br) != 0 && (k & bc) != 0))
                        tmp += likes[r][c];
                    }
                  }
                }
                if (tmp > like) like = tmp;
                break;
              }
  }
  cout << diff << " " << like << endl;
  return 0;
}
