#include <algorithm>
#include <iostream>

using namespace std;

const int INF = 1000;

int V[4];

int num(int L, int A, int B, int C) {
	int res = INF;
	int nc = L / C;
	for (int c = nc; c >= 0; c--) {
		int nb = (L - C * c) / B;
		for (int b = nb; b >= 0; b--) {
			int rest = L - C * c - B * b;
			if (rest % A == 0) {
				res = min(res, c + b + rest / A);
			}
		}
	}
	return res;
}

int num(int A, int B, int C) {
	int res = 0;
	for (int i = 0; i < 4; i++) {
		res += num(V[i], A, B, C);
	}
	return res;
}

int main() {
	for (int i = 0; i < 4; i++) {
		cin >> V[i];
	}
	int mi = INF;
	for (int A = 1; A <= 30; A++) {
		for (int B = A + 1; B <= 30; B++) {
			for (int C = B + 1; C <= 30; C++) {
				mi = min(mi, num(A, B, C));
			}
		}
	}
	cout << mi << endl;
	return 0;
}