#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using ull = unsigned long long;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int a, b, c, d, e, f;
  cin >> a >> b >> c >> d >> e >> f;
  vector<int> x = { 2 * (a + b), 2 * (b + c), 2 * (c + a) };
  vector<int> y = { d, e, f };
  vector<int> p = { 0, 1, 2 };
  int ans = 1e9;
  do {
    int sum = 0;
    rep(i, 3) sum += x[p[i]] * y[i];
    ans = min(ans, sum);
  } while (next_permutation(p.begin(), p.end()));
  cout << ans << '\n';
  return 0;
}