#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9+7;

int L[3], C[3], l[3];
int ans;
int main(){
    REP(i,0,3){
        cin>>L[i];
    }
    REP(i,0,3){
        cin>>C[i];
    }
    REP(i,0,3){
        l[i]=2*(L[i]+L[(i+1)%3]);
    }
    sort(l,l+3);
    sort(C,C+3);
    reverse(C,C+3);

    REP(i,0,3){
        ans+=l[i]*C[i];
    }
    p(ans);
    return 0;
}