#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>

#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<functional>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF 1<<30
#define MP make_pair
#define mp make_pair
#define pb push_back
#define PB push_back
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define ll long long
#define ull unsigned long long

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	int l[3];cin>>l[0]>>l[1]>>l[2];
	int r,b,y;cin>>r>>b>>y;
	int ma=INF;
	vector<pair<int,int> > a;
	REP(i,3) a.pb(mp(l[i],i));
	sort(a.begin(),a.end());
	do{
		ma=min(ma,2*((r+b)*a[0].first+
					(r+y)*a[1].first+
					(b+y)*a[2].first) );
	}while(next_permutation(a.begin(),a.end()));
	cout<<ma<<endl;


	 

}