Most Frequent Shape

You are given an integer \( m \) and a sequence of \( m \) shape names. Your task is to determine the shape that appears most frequently in the sequence.

For example, if \( m = 3 \) and the shapes are: circle triangle circle, then the answer is circle since it appears twice.

You may assume that there is always a unique shape that appears the most number of times.

inputFormat

The input is read from stdin and consists of two lines. The first line contains a single integer \( m \) (the number of shapes). The second line contains \( m \) space-separated strings representing the shapes.

outputFormat

Output the shape (a string) that appears the most frequently. The output should be written to stdout.

1
circle

circle