import Data.List

factors :: Int -> Int -> Int
factors f a
    | a `mod` f /= 0 = 0
    | otherwise = 1 + factors f (a `div` f)

order :: [Int] -> [Int]
order [] = []
order (x:[]) = [x]
order xs = head xs : last xs : order (init $ tail xs)

solve :: [Int] -> String
solve xs =
    let fs = sort $ map (factors 2) xs
        ordered = order fs
        sums = zipWith (+) ordered (tail ordered)
    in if all (>=2) sums then "Yes\n" else "No\n"

main = interact $ (solve . map read . tail . words)
