#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
//#include "util.h"

using namespace std;
typedef long long ll;
typedef unsigned long long ull;

#define PI 3.14159265358979323846
#define EPS 1e-6
#define MIN(a,b) ((a)<(b)?(a):(b))
#define MAX(a,b) ((a)>(b)?(a):(b))
#define CHAR_BIT 8

template <typename _Ty>
ostream& operator << (ostream& ostr, const vector<_Ty>& v) {
	if (v.empty()) {
		cout << "{ }";
		return ostr;
	}
	cout << "{" << v.front();
	for (auto itr = ++v.begin(); itr != v.end(); itr++) {
		cout << ", " << *itr;
	}
	cout << "}";
	return ostr;
}

int yuki0073()
{
	ll ans;
	const string S = "helloworld";
	ll C[26] = { 0 };
	for (ll i = 0; i < 26; i++)
		cin >> C[i];
	
	ans = 1;
	for (ll i = 0; i < S.size(); i++) {
		if (S[i] == 'l' || S[i] == 'o') continue;
		ans *= C[S[i] - 'a'];
	}

	ll P, maxP;

	// l の最大
	maxP = 0;
	for (ll x = 0; x <= C['l' - 'a']; x++) {
		P = x * (x - 1) * (C['l' - 'a'] - x) / 2;
		if (maxP < P) maxP = P;
	}
	ans *= maxP;

	// o の最大
	maxP = 0;
	for (ll x = 0; x <= C['o' - 'a']; x++) {
		P = x * (C['o' - 'a'] - x);
		if (maxP < P) maxP = P;
	}
	ans *= maxP;

	cout << ans << endl;

	return 0;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0073();

	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}