#include <bits/stdc++.h>
using namespace std;

using ll = long long;

int main()
{
    map<char, int> m;
    for (int i = 0; i < 26; i++) {
        int c; cin >> c;
        m['a'+i] = c;
    }
    ll ans = 1;
    ans *= m['h'];
    ans *= m['e'];
    ans *= m['w'];
    ans *= m['r'];
    ans *= m['d'];
    ans *= m['o']/2;
    ans *= m['o']/2+m['o']%2;
    int l = 0;
    for (int i = 2; i <= m['l']-1; i++) {
        l = max(l, i * (i-1)/2 * (m['l']-i));
    }
    ans *= l;

    cout << ans << endl;
}