Highest Frequency Word Count

You are given a sequence of n words. Your task is to determine the frequency of the word that occurs the most in the sequence. In other words, compute the maximum number of times any word appears. Note that the comparison is case-sensitive and if there are several words with the same frequency, the result is still just the maximum count.

Input Format: The first line contains an integer n denoting the number of words. The second line contains n space-separated words.

Output Format: Output a single integer representing the maximum frequency among the given words.

Example:

Input:
6
apple banana apple orange apple banana
Output:
3

</p>

inputFormat

The input consists of two lines:

• The first line contains an integer n, the number of words.
• The second line contains n space-separated words.

outputFormat

Output a single integer which is the maximum frequency of any word in the provided sequence.

## sample

1
apple

1