#include <bits/stdc++.h>

using namespace std;

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

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<int, pii> P;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int main() {
	map<char, int> cnt;
	
	REP(i, 26) {
		int c;
		scanf("%d", &c);
		cnt[i + 'a'] = c;
	}
	
	ll l = 0, o = 0;
	ll ans;
	
	ans = cnt['h'] * cnt['e'] * cnt['w'] * cnt['r'] * cnt['d'];
	if (cnt['l'] < 3 || cnt['o'] < 2) ans = 0;
	
	FOR(i, 2, cnt['l']) {
		int j = cnt['l'] - i;
		chmax(l, (ll)i * (i - 1) / 2 * j);
	}
	
	FOR(i, 1, cnt['o']) chmax(o, i * (cnt['o'] - i));
	
	ans = ans * l * o;
	
	cout << ans << endl;
	
	return 0;
}