#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>

#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define MOD 1000000007
#define int long long
using ll = long long;
using namespace std;
const int INF = 1LL << 50;
using P       = pair<int, int>;

template <class T>
bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    } else {
        return false;
    }
}
template <class T>
bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    } else {
        return false;
    }
}

struct Setup {
    Setup() {
        cin.tie(0);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(20);
    }
} SETUP;

bool is_kado(int a, int b, int c) {
    if (a != c && b > a && b > c) {
        return true;
    }
    if (a != c && b < a && b < c) {
        return true;
    }
    return false;
}

signed main() {
    vector<int> ls(3), cs(3);
    rep(i, 0, 3) {
        cin >> ls[i];
    }
    rep(i, 0, 3) {
        cin >> cs[i];
    }

    vector<int> lss = {2 * (ls[0] + ls[1]), 2 * (ls[1] + ls[2]), 2 * (ls[2] + ls[0])};
    sort(lss.begin(), lss.end());
    sort(cs.begin(), cs.end(), greater<int>());
    int ans = 0;
    rep(i, 0, 3) {
        ans += lss[i] * cs[i];
    }
    cout << ans << endl;
}