#include <iostream>
#include <algorithm>
#include <functional>
#include <string>
#include <climits>
#include <vector>
#include <numeric>
#include <complex>
#include <map>
#include <bitset>
#include <stack>
#include <queue>
using namespace std;

//#define __int64 long long
#define long __int64
#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)
const int Vecy[4] = {0,-1,0,1};
const int Vecx[4] = {1,0,-1,0};


int main(){
	int l[3];
	int cnt[3];
	int use[3] = {0,1,2};
	int ans = INT_MAX;
	int check;
	
	cin >> l[0] >> l[1] >> l[2];
	cin >> cnt[0] >> cnt[1] >> cnt[2];
	
	do {
		check = 0;
		for(int i=0; i<3; i++){
			check += cnt[i] * (l[0] + l[1] + l[2] - l[use[i]]);
		}
		check *= 2;
		ans = min(ans, check);
	} while( next_permutation(use, use + 3 ));     // 次の順列を生成
	
    cout << ans << endl;
	
    return 0;
}