Problem: The year of 2012 is coming...

According to an ancient choradrican legend in this very year, in 2012, Diablo and his brothers Mephisto and Baal will escape from hell, and innumerable hordes of demons will enslave the human world. But seven brave heroes have already gathered on the top of a mountain Arreat to protect us mere mortals from the effect of this terrible evil.

The seven great heroes are: amazon Anka, barbarian Chapay, sorceress Cleo, druid Troll, necromancer Dracul, paladin Snowy and a professional hit girl Hexadecimal. Heroes already know how much experience will be given for each of the three megabosses: a for Mephisto, b for Diablo and c for Baal.

Here's the problem: heroes are as much as seven and megabosses are only three! Then our heroes decided to split into three teams, where each team will go to destroy their own megaboss. Each team member will receive a <image> of experience, rounded down, where x will be the amount of experience for the killed megaboss and y — the number of people in the team.

Heroes do not want to hurt each other's feelings, so they want to split into teams so that the difference between the hero who received the maximum number of experience and the hero who received the minimum number of experience were minimal. Since there can be several divisions into teams, then you need to find the one in which the total amount of liking in teams were maximum.

It is known that some heroes like others. But if hero p likes hero q, this does not mean that the hero q likes hero p. No hero likes himself.

The total amount of liking in teams is the amount of ordered pairs (p, q), such that heroes p and q are in the same group, and hero p likes hero q (but it is not important if hero q likes hero p). In case of heroes p and q likes each other and they are in the same group, this pair should be counted twice, as (p, q) and (q, p).

A team can consist even of a single hero, but it is important that every megaboss was destroyed. All heroes must be involved in the campaign against evil. None of the heroes can be in more than one team.

It is guaranteed that every hero is able to destroy any megaboss alone.

Input

The first line contains a single non-negative integer n (0 ≤ n ≤ 42) — amount of liking between the heroes. Next n lines describe liking in the form "p likes q", meaning that the hero p likes the hero q (p ≠  q). Every liking is described in the input exactly once, no hero likes himself.

In the last line are given three integers a, b and c (1 ≤ a, b, c ≤ 2·109), separated by spaces: the experience for Mephisto, the experience for Diablo and experience for Baal.

In all the pretests, except for examples from the statement, the following condition is satisfied: a = b = c.

Output

Print two integers — the minimal difference in the experience between two heroes who will receive the maximum and minimum number of experience points, and the maximal total amount of liking in teams (the number of friendships between heroes that end up in one team).

When calculating the second answer, the team division should satisfy the difference-minimizing contraint. I.e. primary you should minimize the difference in the experience and secondary you should maximize the total amount of liking.

Examples

Input

3
Troll likes Dracul
Dracul likes Anka
Snowy likes Hexadecimal
210 200 180


Output

30 3


Input

2
Anka likes Chapay
Chapay likes Anka
10000 50 50


Output

1950 2

Note

A note to first example: it the first team should be Dracul, Troll and Anka, in the second one Hexadecimal and Snowy, and in the third Cleo и Chapay.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using pi = pair<int, int>;
const int mod = 1e9 + 7;
const ll inf = ll(1e18);
const double PI = acos(-1), eps = 1e-9;
const int mxn = 42, mxa = 7;
int n, a, b, c;
vi adj[mxa + 5];
void solve() {
  cin >> n;
  map<string, int> m;
  int id = 0;
  while (n--) {
    string s1, second, s2;
    cin >> s1 >> second >> s2;
    if (!m.count(s1)) m[s1] = id++;
    if (!m.count(s2)) m[s2] = id++;
    adj[m[s1]].push_back(m[s2]);
  }
  cin >> a >> b >> c;
  int cur = 0x3f3f3f3f;
  vector<vi> partition;
  for (int i = 1; i <= 5; ++i) {
    for (int j = 1; j <= 6 - i; ++j) {
      int a1 = a / i, b1 = b / j, c1 = c / (7 - i - j);
      int temp = max({a1, b1, c1}) - min({a1, b1, c1});
      if (temp < cur) {
        cur = temp;
        partition.clear();
      }
      if (temp == cur) partition.push_back({i, j, 7 - i - j});
    }
  }
  int ans = 0;
  for (const vi &v : partition) {
    for (int i = 0; i < (1 << 7); ++i) {
      if (__builtin_popcount(i) != v[0]) continue;
      for (int j = 0; j < (1 << 7); ++j) {
        if (__builtin_popcount(j) != v[1] || i & j) continue;
        int cnt = 0;
        set<int> s1, s2, s3;
        for (int k = 0; k < 7; ++k) {
          if ((i >> k) & 1)
            s1.insert(k);
          else if ((j >> k) & 1)
            s2.insert(k);
          else
            s3.insert(k);
        }
        for (const int &x : s1) {
          for (const int &d : adj[x])
            if (s1.count(d)) ++cnt;
        }
        for (const int &x : s2) {
          for (const int &d : adj[x])
            if (s2.count(d)) ++cnt;
        }
        for (const int &x : s3) {
          for (const int &d : adj[x])
            if (s3.count(d)) ++cnt;
        }
        ans = max(ans, cnt);
      }
    }
  }
  cout << cur << ' ' << ans << '\n';
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t;
  t = 1;
  while (t--) solve();
}