#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;

int main() {
	vector<int> c(26, 0);
	for (int i = 0; i < 26; i++) {
		cin >> c[i];
	}
	long long ans = 1;
	// helloworld
	int nl = c['l' - 'a'];
	int max_l = 0;
	for (int i = 2; i < nl; i++) {
		int tmp = i * (i - 1) / 2 * (nl - i);
		max_l = max(max_l, tmp);
	}
	ans *= max_l;;

	int no = c['o' - 'a'];
	int max_o = 0;
	for (int i = 1; i < no; i++) {
		max_o = max(max_o, i * (no - i));
	}
	ans *= max_o;

	ans *= c['h' - 'a'];
	ans *= c['e' - 'a'];
	ans *= c['w' - 'a'];
	ans *= c['r' - 'a'];

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