#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int cnt[128] = {};
  REP (i, 26) {
    int c;
    cin >> c;
    cnt['a' + i] = c;
  }
      
  long long ret = 1;
  ret *= cnt['h'];
  ret *= cnt['e'];
  ret *= cnt['w'];
  ret *= cnt['r'];
  ret *= cnt['d'];

  ret *= (cnt['o']/2) * ((cnt['o']+1)/2);

  int best = 0;
  for (int i = 2; i < cnt['l']; i++) {
    int j = cnt['l'] - i;
    best = max(best, i * (i-1)/2 * j);
  }
  ret *= best;
  
  cout << ret << endl;
  
  return 0;
}