#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP(i,n,0)
#define REP(i,s,e) for (i = s; i < e; i++)
#define rep(i,n) REP(i,0,n)
#define INF 1e8

typedef long long ll;

int main() {
    int i, j, k, ans;
    int vs[4];
    rep (i,4) cin >> vs[i];
    ans = INF;
    REP (i,1,29) REP (j,i+1,30) REP (k,j+1,31) {
        int cnt = 0;
        bool found = true;
        for (int v : vs) {
            int c = INF;
            for (int x = 0; x <= v; x+=i) {
                for (int y = 0; x+y <= v; y+=j) {
                    if ((v-x-y)%k == 0)
                        c = min(c,x/i+y/j+(v-x-y)/k);
                }
            }
            cnt += c;
        }
        ans = min(ans,cnt);
    }
    cout << ans << endl;
    return 0;
}