#include <algorithm>
#include <cstdio>
#define REP(i,n) for(int i=0; i<(int)(n); i++)

inline int getInt(){ int s; scanf("%d", &s); return s; }

#include <queue>
#include <set>

using namespace std;

int main(){
  vector<int> l(3);
  vector<int> a(3);

  REP(i,3) l[i] = getInt();
  REP(i,3) a[i] = getInt();

  vector<int> k(3);
  REP(i,3) k[i] = l[0] + l[1] + l[2] - l[i];

  sort(a.begin(), a.end());
  sort(k.rbegin(), k.rend());

  int ans = 0;
  REP(i,3) ans += 2 * a[i] * k[i];
  printf("%d\n", ans);

  return 0;
}