#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>

using namespace std;

int solve(int i, int j, int k, int a){
    int mi = 100, b;
    for (int n=0; n<=30; n++){
        for (int m=0; m<=30; m++){
            b = a;
            b -= n*i+m*j;
            if (b >= 0 && b % k == 0) mi = min(n+m+b/k, mi);
        }
    }

    return mi;
}

int main(){

    int ans=1e9, tot;
    vector<int> a(4);
    for (int i=0; i<4; i++) cin >> a[i];

    for (int i=1; i<=30; i++){
        for (int j=i+1; j<=30; j++){
            for (int k=j+1; k<=30; k++){
                tot = 0;
                for (int l=0; l<4; l++) tot += solve(i, j, k, a[l]);
                ans = min(tot, ans);
            }
        }
    }

    cout << ans << endl;

    return 0;
}