import Control.Monad
import Control.Applicative
import qualified Data.IntMap as M
import Data.Maybe
import Debug.Trace

main :: IO ()
main = do
  n <- readLn :: IO Int
  unless (n == 0) $ do
    ns <- map read . words <$> getLine :: IO [Int]
    let (key, ans) = solve ns
    if ans > (n `div` 2)
      then print key
      else putStrLn "NO COLOR"
    main

solve :: [Int] -> (Int, Int)
solve ns = --trace (show tab) $
           M.foldrWithKey f (-1, -1) tab
  where
    f :: Int -> Int -> (Int, Int) -> (Int, Int)
    f key a (k, a')
      | a > a' = (key, a)
      | otherwise = (k, a')
    tab = foldr (\a b -> M.insert a
                         (fromMaybe 0 (M.lookup a b)+1) b)
          M.empty ns