#include<cstdio>
#include<vector>


using namespace std;
using ll=long long int;


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


ll l_max_calc(int n)
{
	ll ret=0;

	for(int i=2;i+1<=n;i++)
	{
		ret=max(ret, nC2(i)*(n-i));
	}
	return ret;
}


int main(void)
{
	vector<int> c;
	int o_num, l_num;
	ll ans;

	for(;;)
	{
		c.clear();
		c.resize(26);
		// hello world
		for(int i=0;i<26;i++)
		{
			if(scanf("%d", &c[i])!=1) return 0;
		}
		ans=(ll)c['h'-'a']*c['e'-'a']*c['w'-'a']*c['r'-'a']*c['d'-'a'];
		o_num=c['o'-'a'];
		ans*=(o_num/2)*(o_num-o_num/2);
		l_num=c['l'-'a'];
		ans*=l_max_calc(l_num);

		printf("%lld\n", ans);
	}

	return 0;
}