#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back
#define pcnt __builtin_popcount
#define show(x) cout<<#x<<" = "<<x<<endl;
#define maxs(x,y) x = max(x,y)
#define mins(x,y) x = min(x,y)
#define fi first
#define se second
#define rng(a) a.begin(),a.end()
#define each(it,c) for(__typeof((c).begin()) it=(c).begin();it!=(c).end();it++)
#define sz(x) (int)(x).size()

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef set<int> si;
typedef pair<ll,ll> pll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pll> vpll;
typedef set<ll> sl;
template<typename T>string join(vector<T>&v)
{stringstream s;FOR(i,0,sz(v))s<<' '<<v[i];return s.str().substr(1);}
ll gcd(ll a,ll b){if(a>b)swap(a,b);for(;a>0;b%=a,swap(a,b));return b;}
int modpow(ll a,ll n,int m){if(a==0)return a;ll p=1;for(;n>0;n/=2,a=a*a%m)if(n&1)p=p*a%m;return(int)p;}
void dout(double d){printf("%.12f\n",d);}

const int iinf = 1e9;
const ll linf = 1e18;
const int mod = 1e9+7;
const double eps = 1e-10;

int v[4], b[3];
int calc(){
  int dp[31]={
    0,
    100, 100, 100, 100, 100, 100, 100, 100, 100, 100,
    100, 100, 100, 100, 100, 100, 100, 100, 100, 100,
    100, 100, 100, 100, 100, 100, 100, 100, 100, 100
  };
  FOR(i, 0, 3){
    FOR(j, 0, 31 - b[i])dp[j + b[i]] = min(dp[j] + 1, dp[j + b[i]]);
  }
  return dp[v[0]]+dp[v[1]]+dp[v[2]]+dp[v[3]];
}
main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  FOR(i, 0, 4)cin >> v[i];
  sort(v, v+4);
  if(v[0] == v[1] || v[1] == v[2] || v[2] == v[3]){
    cout << 4 << endl;
    return 0;
  }
  int ans = iinf;
  for(b[0] = 1; b[0] < v[0] + 1; b[0]++){
    for(b[1] = b[0]+1 ; b[1] < v[2] + 1; b[1]++){
      for(b[2] = b[1] + 1; b[2] < v[3] + 1; b[2]++){
        ans = min(ans, calc());
      }
    }
  }
  cout << ans << endl;
}