#include <vector>
#include <queue>
#include <deque>
#include <stack>
#include <map>
#include <set>
#include <algorithm>
#include <functional>
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cctype>
#include <string>
#include <cstring>

using namespace std;

typedef long long ll;

ll memo[101][101];
ll combi(ll a, ll b) {
  if (b == 1) return a;
  if (a == b) return 1;
  if (memo[a][b]) return memo[a][b];
  return memo[a][b]=combi(a-1, b-1)+combi(a-1, b);
}

int main() {
  ll alnum['z'-'a'+1];
  memset(alnum, 0, sizeof(alnum));
  for (int i = 0; i < 'z'-'a'+1; i++) cin >> alnum[i];

  string str = "helowrd";
  ll num[] = {1,1,3,2,1,1,1};
  ll ans = 0;
  ll t = 1;
  bool ok = true;
  for (int i = 0; i < str.size(); i++) {
    if (alnum[str[i]-'a'] >= num[i]) {
      if (str[i] != 'l' && str[i] != 'o') {
        t *= combi(alnum[str[i]-'a'], num[i]);
      }
    }else {
      ok = false;
      ans = 0;
      break;
    }
  }
  if (!ok) {
    cout << 0 << endl;
    return 0;
  }
  if (t) ans = 1;
  for (ll i = alnum['l'-'a']-2; i >= 1; i--) {
    for (ll j = alnum['o'-'a']-1; j >= 1; j--) {
      // cerr << alnum['l'-'a']-i << " " << i << " " << alnum['o'-'a']-j << " " << j << endl;
      ans = max(t*combi(alnum['l'-'a']-i, 2)*combi(i, 1)*combi(alnum['o'-'a']-j, 1)*combi(j, 1), ans);
    }
  }

  cout << ans << endl;
}