F. Colorful Balloons
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Miss Burger is participating in the 2023 ICPC Asia Hefei Regional Contest. She wants to quickly solve the first blood problem by finding the easiest problem.

Miss Burger has observed the colors of all the balloons prepared by the volunteers in advance (It's not allowed, so please don't do that). If the number of balloons of a certain color is greater than $$$50\%$$$ of the total number of balloons, then the problem represented by that color is considered the easiest problem. Each color is represented as a string consisting only of lowercase letters.

Now Miss Burger has provided you with the colors of all the balloons she saw and wants you to tell her which color represents the easiest problem.

Input

The first line contains an integer $$$n$$$ ($$$1\leq n \leq 10^5$$$), representing the total number of balloons Miss Burger saw.

The following $$$n$$$ lines contain a string $$$s_i$$$ ($$$1 \leq \vert s_i\vert \leq 10$$$), representing the color of a balloon, which consists only of lowercase letters.

Output

If the easiest problem is determined, output the color of the easiest problem.

If no the easiest problem can be determined, output "uh-oh" (without quotation marks).

Examples
Input
5
red
green
red
red
blue
Output
red
Input
3
red
blue
yellow
Output
uh-oh
Note

In the first example, Miss Burger saw $$$5$$$ balloons, with colors "red", "green", "red", "red", and "blue". The problem represented by the color "red" appears $$$3$$$ times, which is more than $$$50\%$$$ of the total number of balloons, making it the easiest problem. Therefore, the output is "red".