题目描述
You are given a list of names. Your task is to find all the distinct names in the list and after that
find the frequency count of all these distinct names in the origninal list.
We are interested in the maximum value of the frequency. You have to print this maximum frequency. If, the
maximum value of the frequency occurs a number of times, that is, more than one distinct name has the
same frequency, in that case, output sum of all these maximum values.
INPUT
The first line of input contains a positive integer, t, the number of lines/ names to follow.
After that t lines follow, each contains a string S.
OUTPUT
Output contains a single integer value, that is, the required answer.
CONSTRAINTS
1 ≤ t ≤ 100000
1 ≤ |S| ≤30
S contains only lower case characters.
SAMPLE INPUT
8
veronica
bill
mark
veronica
bill
kevin
hillary
jack
SAMPLE OUTPUT
4
输入格式
见题面
输出格式
见题面