#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <forward_list>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef bitset<16> BS;

const ll MOD = 1E+09 + 7;
const ll INF = 1E18;
const int MAX_N = 1E+05;

int C[26];

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    for (int i = 0; i < 26; i++) {
        cin >> C[i];
    }
    ll H = C['h' - 'a'], E = C['e' - 'a'], L = C['l' - 'a'],
       O = C['o' - 'a'], W = C['w' - 'a'], R = C['r' - 'a'], D = C['d' - 'a'];

    ll ans = 0;
    if (!(H < 1 || E < 1 || L < 3 || O < 2 || W < 1 || R < 1 || D < 1)) {
        ll res = H * E * W * R * D;
        //cout << "res = " << res << "\n";
        for (int i = 2; i <= L - 1; i++) {
            for (int j = 1; j <= O - 1; j++) {
                //cout << "i = " << i << ", j = " << j << ", res = " << res * (i * (i - 1)) / 2 * (L - i) * j * (O - j) << "\n";
                ans = max(ans, res * (i * (i - 1)) / 2 * (L - i) * j * (O - j));
            }
        }
    }

    /*
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            cout << "i = " << i << ", j = " << j << ", dp = " << dp[i][j] << "\n";
        }
    }
    */

    cout << ans << "\n";

    return 0;
}