#include <iostream>
#include <set>

#define FORR(i,b,e) for(int i=(b);i<(int)(e);++i)
#define FOR(i,e) FORR(i,0,e)
#define dump(var) cerr << #var ": " << var << "\n"
#define dumpc(con) for(auto& e: con) cerr << e << " "; cerr<<"\n"

typedef long long ll;
typedef unsigned long long ull;

using namespace std;

ull pt[105][105];

void calc_pascal() {
    pt[0][0] = 1;
    FORR(i, 1, 101) {
        pt[i][0] = 1;
        FORR(j, 1, i+2) {
            pt[i][j] = pt[i-1][j-1] + pt[i-1][j];
        }
    }
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    calc_pascal();

    set<int> g1 = {7, 4, 22, 17, 3}, g2 = {11, 14};
    int C;
    ull n = 1;
    FOR(i, 26) {
        cin >> C;
        if (g1.find(i) != g1.end()) {
            n *= C;
        }
        else if (i == 14) { // 'o'
            n *= C/2 * (C-C/2);
        }
        else if (i == 11) { // 'l'
            if (C < 3) n *= 0;
            else {
                ull m = 0;
                FORR(k, 2, C) {
                    m = max(m, pt[k][2] * (C-k));
                }
                n *= m;
            }
        }
    }
    cout << n << endl;

    return 0;
}