#include <algorithm>
#include <vector>
#include <cfloat>
#include <string>
#include <cmath>
#include <set>
#include <cstdlib>
#include <map>
#include <ctime>
#include <iomanip>
#include <functional>
#include <deque>
#include <iostream>
#include <cstring>
#include <queue>
#include <cstdio>
#include <stack>
#include <climits>
#include <sys/time.h>
#include <cctype>

using namespace std;

typedef long long ll;

int main() {
  int l[3];
  int r, b, y;
  scanf("%d %d %d", &0[l], &1[l], &2[l]);
  scanf("%d %d %d", &r, &b, &y);

  int ans = 1000000000;
  for (int i = 0; i < 3; i++) {
    for (int j = 0; j < 3; j++) {
      if (i == j) continue;
      for (int k = 0; k < 3; k++) {
	if (i == k || j == k) continue;
	ans = min(ans, r*(i[l]+k[l])+b*(i[l]+j[l])+y*(j[l]+k[l]));
      }
    }
  }

  printf("%d\n", ans<<1);
}