#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <numeric>
#include <regex>
#include <tuple>
#include <iomanip>
#include <cmath>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007 // 10^9 + 7
#define INF 1000000000 // 10^9
#define LLINF 1LL<<60

ll C[26];

// aCb
ll comb(ll a, ll b) {
	ll res = 1;
	for (ll i = 0; i < b; i++) res *= (a - i);
	for (ll i = 1; i <= b; i++) res /= i;
	//cout << res << " ";
	return res;
}

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

	for (int i = 0; i < 26; i++) cin >> C[i];

	if (C[3] > 0 && C[4] > 0 && C[7] > 0 && C[11] > 2 && C[14] > 1 && C[17] > 0 && C[22] > 0) {
		//cout << "ok" << endl;

		ll ans = 1;
		ans *= C[3];
		ans *= C[4];
		ans *= C[7];

		ll res = 1;
		for (ll i = 2; i < C[11]; i++) {
			ll tmp = comb(i, 2)*(C[11] - i);
			res = max(res, tmp);
		}
		ans *= res;
		//cout << res << " ";

		ans *=( C[14] / 2*(C[14] - C[14] / 2));
		ans *= C[17];
		ans *= C[22];

		cout << ans << endl;
	}
	else cout << 0 << endl;


	return 0;
}