#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;

int calcnum(vec a, int m){
    int c = 0;
    a[0] += m; a[1] += m; c += m;
    if(a[0] < 0){
        int t = -a[0];
        a[0] += t; a[4] += t; c += t;
    }
    FOR(i, 1, 5) if(a[i] < 0){
        int t = -a[i];
        a[i] += t; a[(i + 1) % 5] += t; c += t;
    }
    return c;
}

bool check(vec a, int n){
    REP(i, 5) a[i] -= n;
    int x0 = 0, x1 = 5000000000000000;
    while(x1 - x0 > 2){
        int xl = (2 * x0 + x1) / 3, xr = (x0 + 2 * x1) / 3;
        if(calcnum(a, xl) < calcnum(a, xr)) x1 = xr;
        else x0 = xl;
    }
    int mm = calcnum(a, 0);
    FOR(x, x0, x1 + 1) chmin(mm, calcnum(a, x));
    return mm <= n;
}

signed main(){

    vec a(5); cin >> a;
    int n0 = 0, n1 = 5000000000000000;
    while(n1 - n0 > 1){
        int n = (n0 + n1) / 2;
        if(check(a, n)) n0 = n;
        else n1 = n;
    }
    Out(n0);

    return 0;
}