#include<sstream>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<string>
#include<vector>
#include<set>
#include<map>
#include<queue>
#include<numeric>
#include<functional>
#include<algorithm>
#include<bitset>
using namespace std;
#define INF (1<<29)
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define uniq(v) v.erase(unique(all(v)),v.end())
#define indexOf(v,x) (find(all(v),x)-v.begin())




int main(){
	int L[3],r,b,y;
	cin>>L[0]>>L[1]>>L[2]>>r>>b>>y;
	int ans=INF;
	sort(L,L+3);
	do{
		int cost=0;
		cost+=2*(L[1]+L[2])*r;
		cost+=2*(L[0]+L[2])*b;
		cost+=2*(L[0]+L[1])*y;
		ans=min(ans,cost);
	}while(next_permutation(L,L+3));
	cout<<ans<<endl;
	return 0;
}