#include<stdio.h>
int main()
{
	long long int c[30];
	int i;
	for (i = 0; i < 26; i++)
		scanf("%lld", &c[i]);
	long long int ans = 1, max;
	ans *= c['h' - 'a'];
	ans *= c['e' - 'a'];
	ans *= c['w' - 'a'];
	ans *= c['r' - 'a'];
	ans *= c['d' - 'a'];
	for (i = 0, max = 0; i <= c['l' - 'a']; i++)
		if (max < i * (i - 1) / 2 * (c['l' - 'a'] - i))
			max = i * (i - 1) / 2 * (c['l' - 'a'] - i);
	ans *= max;
	for (i = 0, max = 0; i <= c['o' - 'a']; i++)
		if (max < i * (c['o' - 'a'] - i))
			max = i * (c['o' - 'a'] - i);
	ans *= max;
	printf("%lld\n", ans);
	return 0;
}