#include <cstring>
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <queue>
#include <algorithm>

int main() {

  long t[26];
  for(long i = 0; i < 26; ++i) {
    scanf("%ld", &t[i]);
  }

  long H = t['h' - 'a'];
  long E = t['e' - 'a'];
  long L = t['l' - 'a'];
  long O = t['o' - 'a'];
  long W = t['w' - 'a'];
  long R = t['r' - 'a'];
  long D = t['d' - 'a'];

  long temp;
  long res = 1;

  res *= H;
  res *= E;

  temp = 0;
  for(long i = 2; i < L; ++i) {
    temp = std::max(temp, (i * (i - 1)) / 2 * (L - i));
  }
  res *= temp;

  temp = 0;
  for(long i = 1; i < O; ++i) {
    temp = std::max(temp, i * (O - i));
  }
  res *= temp;

  res *= W;
  res *= R;
  res *= D;

  printf("%ld\n", res);
  
  return 0;
}