// includes
#include <bits/stdc++.h>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define FI first
#define SE second
using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}
template <typename T> istream &operator>>(istream &is, vector<T> &vec){for(auto &v: vec)is >> v; return is;}

int c[26];

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  rep(i, 26)cin >> c[i];
  ll res = 1;
  res *= c[int('h' - 'a')];
  res *= c[int('e' - 'a')];
  res *= c[int('w' - 'a')];
  res *= c[int('r' - 'a')];
  res *= c[int('d' - 'a')];
  ll tmp = 0;
  for(int i = 1; i < c[int('l' - 'a')]; i++){
    tmp = max(tmp, (ll)i * (i - 1) / 2 * (c[int('l'-'a')] - i));
  }
  res *= tmp;
  int t = c[int('o'-'a')];
  res *= (t - t / 2) * (t / 2);
  cout << res << endl;
	return 0;
}