#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;

#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)



int main() {
	int a[3],b[3],sum[3];
	for(int i = 0;i < 3;i++) cin >> a[i];
	for(int j = 0;j < 3;j++) cin >> b[j];

	sum[0] = a[0] + a[1];
	sum[1] = a[0] + a[2];
	sum[2] = a[1] + a[2];

	sort(sum,sum + 3);
	sort(b,b + 3,greater<int>());
	int ans = 0;
	for(int i = 0;i < 3;i++){
		ans += (sum[i] * b[i]) * 2;
	}
	cout << ans << endl;
	return 0;
}