#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>

using namespace std;


int main(){
	vector<int> v(26);
	for(int i=0; i<26; i++){
		cin >> v[i];
	}
	
	string s = "helloworld";
	vector<int> x(26, 0);
	for(int i=0; i<s.size(); i++){
		x[s[i] - 'a']++ ;
	}

	for(int i=0; i<26; i++){
		if( v[i] < x[i] ){
			cout << 0 << endl;
			return 0;
		}
	}

	long long ans = 1;
	ans *= v['h' - 'a'];
	ans *= v['e' - 'a'];
	ans *= v['w' - 'a'];
	ans *= v['r' - 'a'];
	ans *= v['d' - 'a'];

	long long tmp = 1;
	for(int i=2; i+1<=v['l' - 'a']; i++){
		tmp = max(tmp, (long long)i*(i-1)/2*(v['l' - 'a']-i));
	}
	ans *= tmp;

	tmp = 1;
	for(int i=1; i+1<=v['o' - 'a']; i++){
		tmp = max(tmp, i * (long long)(v['o' - 'a']-i));
	}
	ans *= tmp;
	cout << ans << endl;
	return 0;
}