#include //using namespace std; #pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #define rep(i,j,n) for(ll i=(ll)(j);i<(ll)(n);i++) #define REP(i,j,n) for(ll i=(ll)(j);i<=(ll)(n);i++) #define per(i,j,n) for(ll i=(ll)(j);(ll)(n)<=i;i--) #define ll long long #define ALL(a) (a).begin(),(a).end() #define disup(A,key) distance(A.begin(),upper_bound(ALL(A),(ll)(key))) #define dislow(A,key) distance(A.begin(),lower_bound(ALL(A),(ll)(key))) #define pb emplace_back #define mp std::make_pair // #define endl "\n" //using std::endl; using std::cin; using std::cout; using std::vector; using std::string; using std::upper_bound; using std::lower_bound; using vi=vector; using vii=vector; using pii=std::pair; // constexpr ll MOD=1e9+7; //constexpr ll MOD=998244353; //constexpr ll MOD=10000000; //constexpr ll MOD=1e4; constexpr ll MAX=3e6; constexpr ll INF=(1ll<<60); template class prique :public std::priority_queue, std::greater> {}; template struct Segment_tree{ ll N; T mem; vector node; Segment_tree(vector &X,T m):mem(m){ ll sz=X.size(); N=1; while(N0){ X=(X-1)/2; node[X]=Compare(node[X*2+1],node[X*2+2]); } } T Query(ll a,ll b,ll now,ll l,ll r){ //[a,b),[l,r) if(r<0) r=N; if(r<=a||b<=l) return mem; if(a<=l&&r<=b) return node[now]; auto vl=Query(a,b,now*2+1,l,(l+r)/2),vr=Query(a,b,now*2+2,(l+r)/2,r); return Compare(vl,vr); } }; struct Binary_indexed_tree{ int N; vi bit; Binary_indexed_tree(int n):N(n){ bit.resize(N+1,0); } void add(int x,int a){ for(x;x<=N;x+=(x&-x)) bit[x]+=a; } ll sum(int x){ ll ret=0; for(x;x>0;x-=(x&-x)) ret+=bit[x]; return ret; } ll lower_bound(ll X){ if(sum(N)0){ if(memo+ret<=N&&sum+bit[memo+ret] 0) { if (n & 1) res = res * a % mod; a = a * a % mod; n >>= 1; } return res; } vi fac,finv,inv; void COMinit() { fac.resize(MAX); finv.resize(MAX); inv.resize(MAX); fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for (int i = 2; i < MAX; i++){ fac[i] = fac[i - 1] * i % MOD; inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD; finv[i] = finv[i - 1] * inv[i] % MOD; } } ll COM(ll n,ll r){ if(n memo; rep(i,0,A.size()) memo[A[i]]=0; ll cnt=1; for(auto &p:memo) p.second=cnt++; rep(i,0,A.size()) A[i]=memo[A[i]]; } ll dfs(vi &A,vi &C,ll now){ if(now==4){ ll ret=0; ll memo=INF; rep(i,now,now+3){ memo=std::min(memo,C[i%5]); } rep(i,now,now+3) C[i%5]-=memo; rep(i,0,5) ret+=A[i]-C[i]; rep(i,now,now+3) C[i%5]+=memo; return ret/3; } ll left=0,right=INF; rep(i,now,now+3){ right=std::min(right,C[i%5]); } while(left+2=5) X-=5; C[X]-=y; } ll X=dfs(A,C,now+1); rep(i,now,now+3){ ll X=i; if(X>=5) X-=5; C[X]+=y; C[X]-=z; } ll Y=dfs(A,C,now+1); rep(i,now,now+3){ ll X=i; if(X>=5) X-=5; C[X]+=z; } if(X=5) X-=5; C[X]-=i; } ret=std::max(ret,dfs(A,C,now+1)); rep(j,now,now+3){ ll X=j; if(X>=5) X-=5; C[X]+=i; } } return ret; } int main(){ std::ios::sync_with_stdio(false); std::cin.tie(nullptr); vi A(5); rep(i,0,5) cin>>A[i]; vi B=A; cout<