#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    ll c[26];
    rep(i,26)cin >> c[i];
    ll d = c[3];
    ll e = c[4];
    ll h = c[7];
    ll l = c[11];
    ll o = c[14];
    ll r = c[17];
    ll w = c[22];

    ll ans = 0;
    srep(i,2,l+1){
        rep(j,o+1){
            int ii = l - i;
            int jj = o - j;
            ll tmp = i * (i - 1) / 2 * ii * j * jj;
            ans = max(ans, tmp);
        }
    }
    cout << ans * h * e * w * r * d << endl;
    return 0;
}