#include <iostream>
#include <algorithm>
#include <iomanip>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>

static const int MOD = 1000000007;
using ll = int64_t;
using u32 = uint32_t;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    vector<ll> v(26);
    for (int i = 0; i < 26; ++i) cin >> v[i];
    ll ans1 = v[7]*v[4]*v[22]*v[17]*v[3]*(v[14]/2)*(v[14]/2+v[14]%2), ans2 = 0;
    for (ll i = 2; i < v[11]; ++i) {
        ans2 = max(ans2, i*(i-1)*(v[11]-i)/2);
    }
    cout << ans1*ans2 << "\n";
    return 0;
}