#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cmath>
#include <iostream>
#include <queue>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;

int C[30];


ll solve1(int x){
  ll ret = 0;
  for(ll i=0; i<=x; i++){
    ret = max(ret, i*(x-i));
  }
  return ret;
}
ll solve2(int x){
  ll ret = 0;
  for(ll i=2; i<=x; i++){
    ll tmp = i*(i-1)/2;
    ret = max(ret, tmp*(x-i));
  }
  return ret;
}


int main(){
  rep(i,26){
    cin >> C[i];
  }
  ll ret = 1;
  ret *= C['h'-'a'];
  ret *= C['e'-'a'];
  ret *= C['w'-'a'];
  ret *= C['r'-'a'];
  ret *= C['d'-'a'];

  ret *= solve1(C['o'-'a']);
  ret *= solve2(C['l'-'a']);

  cout << ret << endl;
  return 0;
}