#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("Yes");}else{puts("No");} #define MAX_N 200005 int main() { int l[3], r[3]; rep(i,3)cin >> l[i]; rep(i,3)cin >> r[i]; sort(l,l+3); sort(r,r+3); int ans = (l[0]+l[1])*2*r[2]+(l[0]+l[2])*2*r[1]+(l[1]+l[2])*2*r[0]; cout << ans << endl; return 0; }