#include "bits/stdc++.h"
#define REP(i,n,N) for(ll i=(n); i<(N); i++)
#define RREP(i,n,N) for(ll i=(N-1); i>=n; i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
#define p2(a,b) cout<<(a)<<" "<<(b)<<endl
typedef long long ll;
using namespace std;
const ll inf=1e18;

map<char, ll> m;
ll ans;
int main(){

    for(char c='a';c<='z';c++){
        int a;
        cin>>a;
        m[c]=a;
    }
    string s="helowrd";
    ans=1;
    for(auto c:s){
        if(c=='l') {
            ll mx=0;
            REP(i,0,m[c]+1) {
                ll tmp=1;
                ll a = i;
                ll b = m[c] - a;
                tmp *= a;
                tmp *= b * (b - 1) / 2;
                mx = max(mx, tmp);
            }
            ans*=mx;
        }else if(c=='o'){
            ll a=m[c]/2;
            ll b=m[c]-a;
            ans*=a;
            ans*=b;
        }
        else ans*=m[c];
    }
    p(ans);
    return 0;
}