#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<fstream>
#include<iomanip>
#include<ctime>
#include<complex>
#include<functional>
#include<climits>
#include<cassert>
#include<iterator>
using namespace std;
int a, b, c;
int A, B, C;
int main(){
	cin >> a >> b >> c;
	cin >> A >> B >> C;
	int aa[] = { a, b, c };
	int ww[] = { A, B, C };
	vector<pair<int, int> > v;
	for (int i = 0; i < 3; i++){
		for (int j = i+1; j < 3; j++){
			v.push_back(make_pair(i, j));
		}
	}
	int outt = INT_MAX;
	for (int i = 0; i < v.size(); i++){
		for (int j = 0; j < v.size(); j++){
			for (int k = 0; k < v.size(); k++){
				int countt[] = { 0, 0, 0 };
				countt[v[i].first]++;
				countt[v[i].second]++;
				countt[v[j].first]++;
				countt[v[j].second]++;
				countt[v[k].first]++;
				countt[v[k].second]++;
				bool ok = false;
				for (int ii = 0; ii < 3; ii++){
					if (countt[ii] != 2){
						ok = true;
						break;
					}
				}
				if (ok){
					continue;
				}
				int ans = 0;
				vector<pair<int,int> > V;
				V.push_back(v[i]);
				V.push_back(v[j]);
				V.push_back(v[k]);
				for (int kk = 0; kk < V.size(); kk++){
					int aaa = aa[V[kk].first] + aa[V[kk].second];
					aaa *= 2;
					aaa *= ww[kk];
					ans += aaa;
				}
				outt = min(outt, ans);
			}
		}
	}
	printf("%d\n", outt);
	return 0;
}