#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template<class S, class T> inline S min_L(S a,T b){
  return a<=b?a:b;
}
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(long long &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(long long x){
  int s=0;
  int m=0;
  char f[20];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
long long A[5];
long long x[7];
long long y[7];
long long solve(){
  int i;
  long long res = 0;
  long long k;
  for(i=(0);i<(7);i++){
    if(x[i] < 0){
      return -1;
    }
  }
  for(i=(0);i<(7);i++){
    y[i] = x[i];
  }
  for(i=(0);i<(5);i++){
    k =min_L(min_L(y[i], y[i+1]), y[i+2]);
    res += k;
    {
      auto xr20shxY = (k);
      y[i] -= xr20shxY;
      y[i+1] -= xr20shxY;
      y[i+2] -= xr20shxY;
    }
  }
  return res;
}
int main(){
  long long i;
  long long j;
  long long k;
  long long res = 0;
  long long tmp = 0;
  long long v;
  {
    int WYIGIcGE;
    for(WYIGIcGE=(0);WYIGIcGE<(5);WYIGIcGE++){
      rd(A[WYIGIcGE]);
    }
  }
  for(i=(0);i<(5);i++){
    x[i] = A[i];
  }
  res = tmp = solve();
  for(v = (1LL<<50); v; v /= 2){
    int fg = 0;
    for(i=(-5);i<(6);i++){
      for(j=(-5);j<(6);j++){
        x[0] += i * v;
        x[5] -= i * v;
        x[1] += j * v;
        x[6] -= j * v;
        tmp = solve();
        if(res < tmp){
          res = tmp;
          fg = 1;
        }
        else{
          x[0] -= i * v;
          x[5] += i * v;
          x[1] -= j * v;
          x[6] += j * v;
        }
      }
    }
    if(fg){
      v *= 2;
    }
  }
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay varsion 20200509-1

// --- original code ---
// ll A[5], x[7], y[7];
// 
// ll solve(){
//   ll res = 0, k;
//   rep(i,7) if(x[i] < 0) return -1;
//   rep(i,7) y[i] = x[i];
//   rep(i,5){
//     k = min(y[i], y[i+1], y[i+2]);
//     res += k;
//     (y[i], y[i+1], y[i+2]) -= k;
//   }
//   return res;
// }
// 
// {
//   ll i, j, k, res = 0, tmp = 0, v;
//   rd(A(5));
// 
//   rep(i,5) x[i] = A[i];
//   res = tmp = solve();
// 
//   for(v = (1LL<<50); v; v /= 2){
//     int fg = 0;
//     rep(i,-5,6) rep(j,-5,6){
//       x[0] += i * v;
//       x[5] -= i * v;
//       x[1] += j * v;
//       x[6] -= j * v;
//       tmp = solve();
//       if(res < tmp){
//         res = tmp;
//         fg = 1;
//       } else {
//         x[0] -= i * v;
//         x[5] += i * v;
//         x[1] -= j * v;
//         x[6] += j * v;
//       }
//     }
//     if(fg) v *= 2;
//   }
// 
//   wt(res);
// }