#include <bits/stdc++.h>
using namespace std;
#define repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)
#define rep(i,n) repl(i,0,n)
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back((a))
#define all(x) (x).begin(),(x).end()
#define uniq(x) sort(all(x)),(x).erase(unique(all(x)),end(x))
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

#define INF 2147483600
#define long long long // for codeforces

int main(){
  string hel = "helloworld";
  vector<int> need(26,0);
  for(char c : hel) need[c-'a']++;

  long ans = 1;
  rep(i,26){
    long d;
    cin>>d;
    if(need[i]>0){
      if(d < need[i]){cout << 0 << endl; return 0;}
      if(need[i] == d) continue;
      d -= need[i];
      if(i == 'l' - 'a'){
        long mx = 1;
        for(int j=0; j<=d; j++) mx = max<long>(mx, (d+2-j)*(d+1-j)*(1+j)/2);
        ans *= mx;
      } else if(i == 'o' - 'a'){
        long mx = 1;
        for(int j=0; j<=d; j++) mx = max<long>(mx, (d+1-j)*(1+j));
        ans *= mx;
      } else {
        ans *= (d+1);
      }
    }
  }

  cout << ans << endl;

  return 0;
}