#include<cstdio>
#include<iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>
#include<limits>

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;

int main()
{
	int l[3],color[3];
	cin >> l[0] >> l[1] >> l[2] >> color[0] >> color[1] >> color[2];
	sort(l, l + 3);
	sort(color,color+3);

	ll sum = 0;
	sum	+= (l[0] * 2 + l[1] * 2) * color[2];
	sum += (l[0] * 2 + l[2] * 2 )* color[1];
	sum += (l[1] * 2 + l[2] * 2 )* color[0];
	cout << sum << endl;
	return 0;
}