#include<iostream>
#include<fstream>
#include<sstream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<utility>
#include<complex>
#include<functional>
using namespace std;
int L[3];
int R[3];
int f[3][2] = {
	{ 0, 1 }, { 1, 2 }, { 2, 0 }
};
int p[6][3] = {
	{ 0, 1, 2 }, { 0, 2, 1 }, { 1, 0, 2 }, { 1, 2, 0 }, { 2, 0, 1 }, { 2, 1, 0 } 
};
int main(void){
	int res = 1 << 30;
	for (int i = 0; i < 3; i++){
		cin >> L[i];
	}
	for (int i = 0; i < 3; i++){
		cin >> R[i];
	}

	for (int i = 0; i < 6; i++){
		int sum = 0;
		for (int j = 0; j < 3; j++){
			sum += R[j]*2 * (L[f[p[i][j]][0]] + L[f[p[i][j]][1]]);
		}
		res = min(res, sum);
	}
	cout << res << endl;
	return(0);
}