#include <iostream>
#include <sstream>
#include <math.h>
#include <vector>
#include <array>
#include <algorithm>
#include <queue>
#include <numeric>
#include <map>
#include <set>

using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define SUM(a) accumulate(ALL(a), 0)
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

typedef pair<int, int> pos;
int pos::*x = &pos::first;
int pos::*y = &pos::second;

int dxy[] = {0, 1, 0, -1, 0};

/*================================*/

int alpha[26];
int comb[200][200];

signed main()
{
    FOR(i,1,200) {
        comb[i][1] = i;
        comb[i][i] = 1;
    }
    FOR(i,2,200) {
        comb[i][i] = 1;
        FOR(j,2,i) {
            comb[i][j] = comb[i-1][j-1] + comb[i-1][j];
        }
    }
    REP(i,26) cin >> alpha[i];
    int d = alpha[3];
    int e = alpha[4];
    int h = alpha[7];
    int l = alpha[11];
    int o = alpha[14];
    int r = alpha[17];
    int w = alpha[22];
    bool has = (d>0) && (e>0) && (h>0) && (l>0) && (o>0) && (r>0) && (w>0);
    if (!has) {
        cout << 0 << endl;
        return 0;
    }
    int cnt = 1;
    int maxl = 0;
    FOR(x,1,l) {
        maxl = max(maxl, x * comb[l-x][2]);
    }
    int maxo = 0;
    REP(y,o) {
        maxo = max(maxo, y * (o-y));
    }
    cnt *= d;
    cnt *= e;
    cnt *= h;
    cnt *= maxl;
    cnt *= maxo;
    cnt *= r;
    cnt *= w;
    cout << cnt << endl;
    
    return 0;
}