#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

int L[3], R[3];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    for (int i = 0; i < 3; i++) cin >> L[i];
    for (int i = 0; i < 3; i++) cin >> R[i];
    vector<int> perm(3);
    for (int i = 0; i < 3; i++) perm[i] = i;
    int ans = 1000000000;
    do {
        int tmp = 0;
        for (int i = 0; i < 3; i++) {
            tmp += R[perm[i]] * 2 * (L[i]+L[(i+1)%3]);
        }
        ans = min(ans, tmp);
    } while (next_permutation(perm.begin(), perm.end()));
    cout << ans << endl;
    return 0;
}