fNums.hs

import Data.List
import Control.Monad

most :: [Int] -> Int
most ns = let
            fs :: [[Int]]
            fs = group . sort . map (\n -> read [head . show $ n]) $ ns
            
            foo acc nn = case (fst acc `compare` length nn, snd acc `compare` head nn) of 
                            (GT, _) -> (length nn, head nn)
                            (EQ, GT) -> (length nn, head nn)
                            _ -> acc
            f :: [[Int]] -> (Int, Int)
            f nn = foldl foo (length.head $ nn, head.head $ nn) nn
            in snd $ f fs

main = do
    n <- readLn
    ns <- replicateM n readLn
    print $ most ns