#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = e-1; i >= s; i--)
#define rrep(i,n) RREP(i,0,n)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

typedef long long ll;

int main() {
    ll i, maxl, ans;
    ll c[256];
    REP (i,'a','z'+1) cin >> c[i];
    maxl = 0;
    REP (i,2,c['l']) {
        maxl = max(maxl,i*(i-1)/2*(c['l']-i));
    }
    ans = c['h']*c['e']*maxl*(c['o']/2)*((c['o']+1)/2)*c['w']*c['r']*c['d'];
    cout << ans << endl;
    return 0;
}