//#include <bits/stdc++.h>
#include <assert.h>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <iterator>
using namespace std;

typedef signed long long ll;

#define pp(...) (void)printf(__VA_ARGS__)
#define For(x,to) for(x=0;x<(to);x++)
#define ForAuto(x,arr) for(auto& x:arr)
#define ForBeginEnd(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define All(a) (a.begin()),(a.end())
#define Zeros(a) memset(a,0,sizeof(a))
#define Minus(a) memset(a,0xff,sizeof(a))

#define PI 3.14159265
#define EPS (1e-10)
#define EPS_eq(a,b) (abs((a)-(b)) < EPS)

#pragma GCC diagnostic ignored "-Wconversion"

//#define int long long
#define INF 1000*1000

int dxy[] = {0, 1, 0, -1, 0};

typedef pair<int, int> P;

void pp_int(int x){ printf("%d\n", x); };

//-------------------------------------------------

int a,b,c;
int i,v[4], memo[200];

int rec(int t){
    if (t <= 0) return 0;
    if(memo[t]) return memo[t];
    int res = INF;
    if(a <= t) res = min(res, rec(t-a) + 1);
    if(b <= t) res = min(res, rec(t-b) + 1);
    if(c <= t) res = min(res, rec(t-c) + 1);
    return memo[t] = res;
}

signed main() {
    int mn = 0;
    For(i, 4){
        cin>>v[i];
        mn += v[i];
    }
    for(a=1;a<=31;a++){
        for(b=a+1;b<=31;b++){
            for(c=b+1;c<=31;c++){
                Zeros(memo);
                mn = min(mn, rec(v[0]) + rec(v[1]) + rec(v[2]) + rec(v[3]));
            }
        }
    }
    printf("%d\n", mn);
    return 0;
}