#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (ll i = (s); i < (ll)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (ll i = (ll)(s - 1); i >= (ll)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
bool chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
bool chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") {
    cout << (f ? yes : no) << "\n";
}

vector<string> split_string(const string& s, char c = ' ') {
    vector<string> res;
    stringstream ss(s);
    string tmp;
    while (getline(ss, tmp, c)) {
        res.emplace_back(tmp);
    }
    return res;
}

void solve() {
    const int n = 26;
    vl a(256);
    rep(i, n) cin >> a[i + 'a'];
    ll ans = a['d'] * a['e'] * a['h'] * a['r'] * a['w'];
    if (a['l'] >= 3) {
        // 2 - 1
        int x = a['l'] - 3;
        ll tmp = 1;
        rep(i, x + 1) {
            ll cnt = (2LL + i) * (1LL + i) / 2 * (x - i + 1);
            chmax(tmp, cnt);
        }
        ans *= tmp;
    } else ans = 0;
    if (a['o'] >= 2) {
        ll x = a['o'];
        ll tmp = (x / 2) * ((x + 1) / 2);
        ans *= tmp;
    } else ans = 0;
    cout << ans << "\n";
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}