#include<iostream>
#include<vector>
#include<algorithm>
#include<cctype>
#include<utility>
#include<string>
#include<cstring>
#include<cmath>
#include<numeric>
#include<queue>
#include<climits>
#include<cstdio>


#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
//#define INF ((LLONG_MAX) / (2))
using namespace std;
typedef pair<int, int> P;
typedef pair<llong, llong> LP;
typedef pair<int, P> PP;
typedef pair<llong, LP> LPP;
typedef long long int ll;
typedef pair<ll,int> LL_IP;
typedef pair<ll,ll> LL_LLP;
#define INF 1e9+7


int main(){

    vector<ll> arr(26,0);
    REP(i,26){
        cin >> arr[i];
    }
    ll d = arr[3];
    ll e = arr[4];
    ll h = arr[7];
    ll l = arr[11];
    ll o = arr[14];
    ll r = arr[17];
    ll w = arr[22];

    ll ans = d*e*h*r*w;

    ll maxil = 0;
    for(ll i = 2;i <= l-1;i++){
        ll tmp = (i*(i-1)/2)*(l-i);
        maxil = max(maxil,tmp);
    }

    ll maxio = 0;
    for(ll i = 1;i <= o/2;i++){
        ll tmp = i*(o-i);
        maxio = max(maxio,tmp);
    }
    ans *= maxil*maxio;
    cout << ans << endl;

    return 0;
}