import Data.Set as Set
import Control.Monad
import qualified Data.Map as Map
import Data.Ord
import Data.List

main :: IO ()
main = do
    n <- read <$> getLine
    alist <- replicateM n getLine
    putStrLn $ solve n alist

solve :: Int -> [String] -> String
solve n alist = if limit >= snd (counted !! 0) then "YES" else "NO"
    where set = Set.fromList alist
          counted = sortOn (Down . snd) $ toList $ Set.map (\x -> (x, length $ Prelude.filter (== x) alist)) set
          limit = if n `mod` 2 == 0 then n `div` 2 else n - n `div` 2