#include using namespace std; using Int32 = int_fast32_t; using Word32 = uint_fast32_t; using Int64 = int_fast64_t; using Word64 = uint_fast64_t; using Int128 = __int128_t; using Word128 = __uint128_t; using Int = int_fast64_t; using Word = uint_fast64_t; using F32 = float; using F64 = double; using F80 = long double; using VInt = vector; using VVI = vector; using VWord = vector; using VVW = vector; using VF32 = vector; using VF64 = vector; using VF80 = vector; using VS = vector; using VVS = vector; using VB = vector; using VVB = vector; using PII = pair; using PWW = pair; using VPII = vector; using VPWW = vector; using PQ_PII = priority_queue>; #define SZ(x) ((Int)(x).size()) #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) #define rep(i,n) for(Int i=0, i##_len=(n); i> v[i]; Int ans = 10000; for (Int a = 1; a <= 30; a++) { for (Int b = (a + 1); b <= 30; b++) { for (Int c = (b + 1); c <= 30; c++) { VInt dp(31, 10000); dp[0] = 0; VInt ks = {a, b, c}; rep(i,3) reps(j,30) { Int ki = ks[i]; if (j + ki <= 30) dp[j+ki] = min(dp[j + ki], dp[j] + 1); } ans = min(ans, v[0] + v[1] + v[2] + v[3]); } } } cout << ans << '\n'; return 0; }