#include <bits/stdc++.h>

using namespace std;

#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()

template<typename A, typename B> inline bool chmax(A &a, B b) { if (a<b) { a=b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a>b) { a=b; return 1; } return 0; }

typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll INF = 1ll<<29;
const ll MOD = 1000000007;
const double EPS  = 1e-10;

int main() {
	int l[3], c[3];
	REP(i, 3) scanf("%d", l + i);
	REP(i, 3) scanf("%d", c + i);
	
	
	int ans = INF;
	
	sort(l, l + 3);
	sort(c, c + 3);
	do {
		int ls[3];
		REP(i, 3) ls[i] = 2 * (l[i] + l[(i + 1) % 3]);
		
		int now = 0;
		REP(i, 3) now += ls[i] * c[i];
		chmin(ans, now);
		
	} while (next_permutation(l, l + 3));
	

	
	cout << ans << endl;
	
	return 0;
}