{"trustable":false,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cscript type\u003d\u0027text/x-mathjax-config\u0027\u003eMathJax.Hub.Config({tex2jax: { inlineMath: [[\u0027$\u0027,\u0027$\u0027]] } }); \u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027 src\u003d\u0027https://cdnjs.cloudflare.com/ajax/libs/mathjax/2.7.1/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\u0027\u003e\u003c/script\u003e\n\u003cscript type\u003d\u0027text/javascript\u0027\u003esetTimeout(function(){MathJax.Hub.Queue([\u0027Typeset\u0027, MathJax.Hub, \u0027left_view\u0027]);}, 2000);\u003c/script\u003e\n\u003cdiv class\u003d\"panel_content\"\u003e\n\u003ch4\u003eEvery time we will count balloons?\u003c/h4\u003e\n\u003ccenter\u003e\u003cimg height\u003d\"200px\" width\u003d\"300px\" src\u003d\"http://www.progkriya.org/images/news/contest/icpc13/contest.jpg\"\u003e \u003c/center\u003e\n It is matter of sorrow that previous year no teams were selected for ICPC Regional Contest from Batch 11 of BRUR. So, every team were very sad. On the day of contest one of our friends told us a interesting thing that the diffrent color of balloons float around the contest room denotes different problem. Seeing a certain color of balloon that floating more amount than the other colors you can say that a certain problem is solved by most of the teams.\n \u003cbr\u003e \n \u003cbr\u003eAfter listneing that you are interested to know the color of balloon for the most popular problem (solved by most of the teams).\n \u003cbr\u003e \n\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"Input contains multiple test cases. Each test case starts with a number N (0 \u0026lt; N \u0026lt;\u003d 1000) -- the total number of balloons distributed. The next N lines contain one color each. The color of a balloon is a string of up to 15 lower-case letters. \n\u003cbr\u003e \n\u003cbr\u003eA test case with N \u003d 0 terminates the input and this test case is not to be processed. \n\u003cbr\u003e"}},{"title":"Output","value":{"format":"HTML","content":"For each case, print the color of balloon for the most popular problem on a single line. It is guaranteed that there is a unique solution for each test case. \n\u003cbr\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e5\ngreen\nred\nblue\nred\nred\n3\npink\norange\npink\n0\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003ered\npink\u003c/pre\u003e"}}]}