#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
#include <ciso646>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;

inline bool cheak(ll x, ll y, ll xMax, ll yMax){ return x >= 0 && y >= 0 && xMax > x && yMax > y; }
inline ll toInt(string s) { ll v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string toString(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }

#define For(i,a,b)	for(ll (i) = (a);i < (b);(i)++)
#define rep(i,n)	For(i,0,n)
#define clr(a)		memset((a), 0 ,sizeof(a))
#define mclr(a)		memset((a), -1 ,sizeof(a))
#define all(a)		(a).begin(),(a).end()
#define sz(a)		(sizeof(a))

const int dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };
const ll mod = 1000000007;
const ll INF = 1e9 + 2;

int main()
{
	int d[3];
	cin >> d[0] >> d[1] >> d[2];
	int r, b, y;
	cin >> r >> b >> y;

	int ans = INF;
	rep(i, 3)rep(j, 3)
	rep(k, 3)rep(l, 3)
	rep(m, 3)rep(n, 3){
		if ((i != j && k != l && m != n) &&
			(i == k || i == l) && (j != k && j != l) &&
			(k == m || k == n) && (l != m && l != n) &&
			(m == i || m == j) && (n != i && n != j)
			){
			int tmp = 
				(d[i] * 2 + d[j] * 2) * r + 
				(d[k] * 2 + d[l] * 2) * b + 
				(d[m] * 2 + d[n] * 2) * y;
			ans = min(ans, tmp);
		}
	}

	cout << ans << endl;
	return 0;
}