#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int cost[4][35][35][35];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    vector<int> V(4);
    for(int i = 0; i < 4; ++i)  cin >> V[i];
    constexpr int inf = 1e+8;
    for(int a = 1; a <= 30; ++a){
        for(int b = a + 1; b <= 30; ++b){
            for(int c = b + 1; c <= 30; ++c){
                for(int i = 0; i < 4; ++i){
                    cost[i][a][b][c] = inf;
                    for(int x = 0; a * x <= V[i]; ++x){
                        int S = a * x;
                        for(int y = 0; S + b * y <= V[i]; ++y){
                            S += b * y;
                            if((V[i] - S) % c == 0){
                                int z = (V[i] - S) / c;
                                chmin(cost[i][a][b][c], x + y + z);
                            }
                            S -= b * y;
                        }
                    }
                }
            }
        }
    }
    int ans = inf;
    for(int a = 1; a <= 30; ++a){
        for(int b = a + 1; b <= 30; ++b){
            for(int c = b + 1; c <= 30; ++c){
                chmin(ans, cost[0][a][b][c] + cost[1][a][b][c] + cost[2][a][b][c] + cost[3][a][b][c]);
            }
        }
    }
    cout << ans << endl;

    return 0;
}