#include "bits/stdc++.h" using namespace std; /* macro */ #define rep(i,a,b) for(int i=a;i b; i--) #define int long long #define exist(s,e) ((s).find(e)!=(s).end()) #define all(v) (v).begin(), (v).end() #define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++) #define sum(v) accumulate(all(v), (0LL)) #define pb push_back /* alias */ template using vec = vector; typedef vector vi; typedef pair pi; /* constant */ const int inf = pow(2, 57); const int mod = 1e9 + 7; int dx[8]={1,0,-1,0,-1,1,-1,1}; int dy[8]={0,1,0,-1,-1,-1,1,1}; const string alpha = "abcdefghijklmnopqrstuvwxyz"; /* io_method */ int input(){int tmp;cin >> tmp;return tmp;} string raw_input(){string tmp;cin >> tmp;return tmp;} string readline(){string s;getline(cin, s);return s;} template void printx(T n){cout << n;} template void printx(pair p){cout << "(" << p.first << "," << p.second << ")";} template void printx(vector v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";} template void print(T n){printx(n);cout << endl;} template void print(set s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;} template void print(map mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" << endl;} /* general_method */ templatebool chmax(T &a, const T &b) { if (abool chmin(T &a, const T &b) { if (b> v0 >> v1 >> v2 >> v3; int ans = inf; rep(i,1,31){ rep(j,1,31){ rep(k,1,31){ vi dp(31, inf); dp[0] = 0; rep(t,0,31) if(t + i < 31) chmin(dp[t + i], dp[t] + 1); rep(t,0,31) if(t + j < 31) chmin(dp[t + j], dp[t] + 1); rep(t,0,31) if(t + k < 31) chmin(dp[t + k], dp[t] + 1); chmin(ans, dp[v0] + dp[v1] + dp[v2] + dp[v3]); } } } print(ans); }