#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll=long long;
const int INF=1e9;
void solve(){
    int arr[4];
    for(int i=0;i<4;++i)cin>>arr[i];
    auto solve=[&] (int a,int b,int c){
        vector dp(31,INF);
        dp[0]=0;
        for(auto&val:vector<int>({a,b,c})){
            for(int n=0;n<31-val;++n){
                dp[n+val]=min(dp[n+val],dp[n]+1);
            }
        }
        ll ret=0;
        for(int i=0;i<4;++i)ret+=dp[arr[i]];
        return ret;
    };
    ll ans=INF;
    auto r=views::iota(1,31);
    for(auto [a,b,c]: std::views::cartesian_product(r,r,r) | 
            std::views::filter([](auto t){
                auto [a,b,c]=t;
                return a<b&&b<c;
            })){
        ll tans=solve(a,b,c);
        ans=min(ans,tans);
    }
    cout<<ans<<endl;
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    int T=1; //cin>>T;
    while(T--)solve();
    return 0;
}