{"raw_statement":[{"iden":"statement","content":"The input consists of the following lines: \n\n*Limits* \n\nA string that appears a number of times that is greater than the sum of the others, if there is any, or the string \"NONE\" otherwise.\n\n"},{"iden":"input","content":"The input consists of the following lines:   on the first line: an integer $N$;  on each of the next $N$ lines: the species of an animal as a string of length at most 20, containing only ASCII alphanumeric characters. *Limits*   $1 <= N <= 2 times 10^5$. "},{"iden":"output","content":"A string that appears a number of times that is greater than the sum of the others, if there is any, or the string \"NONE\" otherwise."},{"iden":"examples","content":"Input3\nfrog\nfish\nfrog\nOutputfrog\nInput4\ncat\nmouse\nmouse\ncat\nOutputNONE\n"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ n \\in \\mathbb{Z}^+ $ be the number of friends.  \nLet $ U = (u_1, u_2, \\dots, u_n) $ be a sequence of distinct usernames, where each $ u_i \\in \\Sigma^* $, $ \\Sigma = \\{A\\text{-}Z, a\\text{-}z, 0\\text{-}9, \\_\\} $, and $ 1 \\leq |u_i| \\leq 12 $.\n\n**Constraints**  \n1. $ 1 \\leq n \\leq 10^5 $  \n2. Each $ u_i $ consists only of characters in $ \\Sigma $, and $ |u_i| \\in [1, 12] $  \n3. All $ u_i $ are distinct.\n\n**Objective**  \nFor each $ i \\in \\{1, \\dots, n\\} $, output:  \n$$ u_i : \\text{F} $$  \non a separate line, in order of increasing $ i $.","simple_statement":"Read n.  \nFor each of the n friends, read their username.  \nFor each friend, print: username + \": F\"","has_page_source":false}