import           Control.Monad
import           Data.Bool
import           Data.List
import qualified Data.Vector   as V

readInt = readLn :: IO Int

readInts = map read . words <$> getLine :: IO [Int]

readNInts = flip replicateM readInts

main :: IO ()
main = do
  ae <- replicateM 6 readLn :: IO [Int]
  if all (<= last ae) $ map distance $ combination 2 (init ae)
    then putStrLn "Yay!"
    else putStrLn ":("

combination :: Int -> [a] -> [[a]]
combination 0 xs = [[]]
combination _ [] = []
combination n (x:xs) = [x : y | y <- combination (n - 1) xs] ++ combination n xs

distance :: [Int] -> Int
distance [a, b] = abs $ a - b