Problem1580--xjf's ballon

1580: xjf's ballon

[Creator : ]
Time Limit : 1 sec  Memory Limit : 128 MB

Description

As an acmer we all know which balloon appears most frequently in a match is the simplest. XJF wants to know that question in a competition the simplest. As a ACM God, please help her.

Input

The first line is the n which means n ballons

The follow lines are the color of the ballons

But only have red,blue,green ballons

Multiple data read in

Output

The simplest problem's ballon color

Sample Input Copy

5
green
red
blue
red
red

Sample Output Copy

red

Source/Category