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

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

template < typename T >
void vprint(T &V){
	for(auto v : V){
    	cout << v << " ";
	}
	cout << endl;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    vector<ll> L(3);
    FOR(i, 0, 3){
        cin >> L[i];
    }
    sort(ALL(L));

    ll R, B, Y;
    cin >> R >> B >> Y;

    ll min_len = inf;
    do{
        ll len = 0;
        len += R * (L[0] + L[1]) * 2;
        len += B * (L[1] + L[2]) * 2;
        len += Y * (L[2] + L[0]) * 2;
        chmin(min_len, len);
    
    }while(next_permutation(ALL(L)));
    
    p(min_len);

    return 0;
}