#include<iostream>
#include<cstdio>
#include<cstring>
#include <cstdlib>  
#include <cmath>   
#include<cctype>
#include<string>
#include<set>
#include<iomanip>
#include <map>
#include<algorithm>
#include <functional>
#include<vector>
#include<climits>
#include<stack>
#include<queue>
#include <deque>
#include <climits>
#include <typeinfo>
#include <utility> 
#define all(x) (x).begin(),(x).end()
#define rep(i,m,n) for(int i = m;i < n;++i)
#define pb push_back
#define fore(i,a) for(auto &i:a)
#define rrep(i,m,n) for(int i = m;i >= n;--i)
#define INF INT_MAX/2
using namespace std;
using ll = long long;
using R = double;
using Data = pair<ll, vector<int>>;
const ll MOD = 1e9 + 7;
const ll inf = 1LL << 50;
struct edge { ll from; ll to; ll cost; };




int main() {
	int l1, l2, l3, r, b, y;
	cin >> l1 >> l2 >> l3 >> r >> b >> y;

	vector<int>lo = { l1 + l2,l2 + l3,l3 + l1 };
	vector<int>cnt = { r,b,y };
	sort(all(cnt));
	
	int ans = 101010;
	do {
		ans = min(ans,2*(cnt[0] * lo[0] + cnt[1] * lo[1] + cnt[2] * lo[2]));
	} while (next_permutation(all(cnt)));

	cout << ans << endl;

	
	return 0;
}