import Data.List (sort)

minimumLength :: [Int] -> Int
minimumLength (l1 : l2 : l3 : r : b : y : _) = sum $ zipWith (*) ls cs
    where
        ls = sort $ map (* 2) [l1 + l2, l2 + l3, l3 + l1]
        cs = reverse $ sort [r, b, y]

main :: IO ()
main = print . minimumLength . map read . words =<< getContents