def ascan; gets.split.map(&:to_i); end
def scan; gets.to_i; end

require 'prime'

ll = ascan

@dp={}
def makeable(l,boards)
    return 0 if l==0
    key = [l]
    return @dp[key] if @dp[key]
    
    best = 9999
    boards.each{|b|
        next if l<b
        m = makeable(l-b, boards)
        return @dp[key]=false if !m
        best = [best,m].min
    }
    return @dp[key]=best+1
end

best = 5e15.to_i

1.upto(28){|a|
    (a+1).upto(29){|b|
        (b+1).upto(30){|c|
            @dp={}
            cost = 0
            x = [a,b,c]
            ll.each{|l|
                m = makeable(l,x)
                if !m
                    cost = nil; break
                end
                cost += m
            }
            best = [best,cost].min if cost
        }
    }
}

p best