#include <bits/stdc++.h>
#define PB push_back
#define MP make_pair
#define REP(i,n) for (int i=0;i<(n);i++)
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
const int INF=1e9;
int main(){
  int l1,l2,l3,r,b,y;
  cin>>l1>>l2>>l3;
  cin>>r>>b>>y;
  int a[3]={l1+l2,l2+l3,l3+l1};
  int ans=INF;
  do{
    int res=a[0]*r+a[1]*b+a[2]*y;
    res*=2;
    ans=min(res,ans);
  }while(next_permutation(a,a+3));
  cout<<ans<<endl;
}