#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define INF 1e9 #define PI acos(-1) typedef long long ll; map cnt; ll ans=1; int main() { string hello = "helowrd"; for (char i = 'a'; i <= 'z'; i++) { int sub; cin >> sub; cnt[i] = sub; } for (int k = 0; k < hello.size(); k++) { char fig = hello[k]; if (fig == 'o') { ans *= cnt[fig] / 2; cnt[fig] -= cnt[fig] / 2; ans *= cnt[fig]; } else if (fig == 'l') { ll res = 0; for (int i = 0; i <= cnt[fig]; i++) { res = max(res, (i*(i - 1) / 2)*(cnt[fig] - i)); } ans *= res; } else { ans *= cnt[fig]; } } cout << ans << endl; return 0; }