#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, string> pls;


ll C[110][110];

void comb_table(ll N) {
	for (ll i = 0; i <= N; i++) {
		for (ll j = 0; j <= i; j++) {
			if (j == 0 || j == i) {
				C[i][j] = 1LL;
			}
			else {
				C[i][j] = C[i - 1][j - 1] + C[i - 1][j];
			}
		}
	}
}

int main()
{
	int alp[30];
	ll ans = 1;

	comb_table(100);

	for (int i = 'a', j = 0; i <= 'z'; i++) {
		cin >> alp[j++];
	}

	for (int i = 'a',j = 0; i <= 'z'; i++,j++) {
		if (i == 'e' || i == 'h' || i == 'd' || i == 'w' || i == 'r') {
			if (alp[j] < 1) {
				ans = 0;
				break;
			}
			else {
				ans *= alp[j];
			}
		}
		else if (i == 'o') {
			if (alp[j] < 2) {
				ans = 0;
				break;
			}
			else {
				ans *= (alp[j]/2)*(alp[j]/2 + alp[j]%2);
			}
		}
		else if (i == 'l') {
			if (alp[j] < 3) {
				ans = 0;
				break;
			}
			else {
				ans *=C[alp[j]*2/3 + (alp[j]*2%3)/2][2];
				ans *= alp[j] - (alp[j] * 2 / 3 + (alp[j]*2%3)/2);
			}
		}
	}
	cout << ans << endl;
	return	0;
}