#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  vector<int> l(3), rby(3);
  REP(i, 3) cin >> l[i];
  vector<int> ls{l[0] + l[1], l[0] + l[2], l[1] + l[2]};
  REP(i, 3) cin >> rby[i];
  vector<int> per{0, 1, 2};
  int ans = INF;
  do {
    int ribbon = 0;
    REP(i, 3) ribbon += ls[i] * 2 * rby[per[i]];
    chmin(ans, ribbon);
  } while (next_permutation(ALL(per)));
  cout << ans << '\n';
  return 0;
}