#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a <= b) {
        a = b;
        return true;
    }
    return false;
}
ll solve(ll t,ll x,ll y,ll z){
    ll ans=INF/10;
    rep(i,31){
        rep(j,31){
            rep(k,31){
                if(x*i+y*j+k*z==t)chmin(ans,i+j+k);
            }
        }
    }
    return ans;
}
int main(){
    vl v(4);rep(i,4)cin >> v[i];
    ll ans=INF/10;
    for(int i=1;i<=30;i++){
        for(int j=i+1;j<=30;j++){
            for(int k=j+1;k<=30;k++){
                ll ret=0;
                rep(l,4){
                    ret+=solve(v[l],i,j,k);
                }
                //cout << ret <<endl;
                chmin(ans,ret);
            }
        }
    }
    cout << ans <<endl;
}