#include <bits/stdc++.h>
#define rep(i, a) rep2 (i, 0, a)
#define rep2(i, a, b) for (int i = (a); i < (b); i++)
#define repr(i, a) repr2 (i, 0, a)
#define repr2(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define asn(a, b, c) fill_n(&(b), sizeof(a) / sizeof(b), c)
using namespace std;
typedef long long ll;
const ll inf = 1e9;
const ll mod = 1e9 + 7;

int main() {
	int L[3];
	rep (i, 3) cin >> L[i];
	int R, B, Y;
	cin >> R >> B >> Y;

	int a[3] = {0, 1, 2};

	ll ans = inf;
	do {
		ll x = (L[a[0]] + L[a[1]]) * 2;
		ll y = (L[a[1]] + L[a[2]]) * 2;
		ll z = (L[a[2]] + L[a[0]]) * 2;

		ans = min(ans, x * R + y * B + z * Y);
	} while (next_permutation(a, a + 3));

	cout << ans << endl;

	return 0;
}