#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ull = unsigned long long;

#ifndef __MACRO_H__
#define __MACRO_H__

#define all(collection)  (collection).begin(), (collection).end()		// begin to end
#define rep(i, begin, end) for (ll i = begin; i < end; i++)				// repeat
#define repr(i, begin, end) for (ll i = begin; end < i; i--)			// repeat reverse
#define size(collection) ((ll) (collection).size())						// collection size

#endif

ll Combination2(ll n)
{	
	return n * (n - 1) / 2;
}

int main(void)
{
	vector<ll> v('z' - 'a');
	rep(i, 0, size(v))
		cin >> v[i];

	ll ans = 1;
	rep(i, 0, size(v))
	{	// helloworld
		switch (i)
		{
		case 'h' - 'a':
		case 'e' - 'a':
		case 'w' - 'a':
		case 'r' - 'a':
		case 'd' - 'a':
			ans *= v[i];
			break;
		case 'o' - 'a':
			ans *= (v[i] % 2 == 0) ? (v[i] / 2) * (v[i] / 2) : (v[i] / 2 + v[i] % 2) * (v[i] / 2);
			break;
		case 'l' - 'a':
			ans *= (v[i] % 3 == 0) ? Combination2(v[i] / 3 * 2) * v[i] / 3 : Combination2(v[i] / 3 * 2 + v[i] % 3) * (v[i] / 3);
			break;
		}
	}

	cout << ans << endl;
	return 0;
}