#include <bits/stdc++.h>
using namespace std;

string tb1 = "A123456789TJQK";
string tb2 = "DCHS";

bool cmp(string a,string b){
	a[0] = 'A'+tb2.find(a[0]);
	a[1] = 'A'+tb1.find(a[1]);
	b[0] = 'A'+tb2.find(b[0]);
	b[1] = 'A'+tb1.find(b[1]);	
	return a < b;
}
int main(){
	int L[3];
	int A[3];
	cin >> L[0] >> L[1] >> L[2];
	cin >> A[0] >> A[1] >> A[2];
	sort(L,L+3);
	int ans = 1e9;
	do{
		int sum = 0;
		sum = A[0] * (2*L[0]+2*L[1]);
		sum += A[1] * (2*L[1]+2*L[2]);
		sum += A[2] * (2*L[0]+2*L[2]);
		ans = min(ans,sum);
	}while(next_permutation(L,L+3));
	cout << ans << endl;
}