import Data.Char

data Tree = Empty | Node Tree Int Tree deriving Show

toTree [] = Empty
toTree (n:ns) = Node (toTree ns) n (toTree ns)

plusMinus sum list Empty = [(sum,list)]
plusMinus sum list (Node l n r) = plusMinus  (sum+n) (list++"+"++(show n)) l ++ plusMinus (sum-n) (list++"-"++(show n)) r

solve (n:ns) = (++"=7") . snd . head . filter (\n -> (fst n) == 7) . plusMinus n (show n) $ toTree ns

toDigit x = ord x - ord '0'

main = do
  kippu <- map toDigit <$> getLine
  putStrLn $ solve kippu
