G :: Choose Your Words Carefully

Time Limit: 1 Second    Memory Limit: 32768 KB

Let's face it, most students who do a good job on programming contest problems aren't the best writers. However, there is no artistic process that a good programmer can't improve with a little program to automate the process.

In this case, your writing problem is a tendency to use words too often. To help check for this, you are going to write a program that will search your papers for the word or words you use most often.

Input

The input consists entirely of your paper. Each line will be under 80 characters and will contain words, punctuation, and numbers. Words consist of the characters {a-z,A-Z,0-9}. Words are separated by whitespace, end-of-line, and punctuation. The punctuation that may be found includes the characters ,.;\''\"()/:-. No other characters will be found in the input.

The input ends at end-of-file.

Word comparisons are case-insensitive.

Output

Your output begins with the line:

occurrences

where n is the number of times the most frequently appearing word occurs.

Following that line will be the words that occurred n times, one per line. The words may be listed in lexicographic order.

Sample Input

Fourscore and seven years ago our fathers brought forth on this
continent a new nation, conceived in liberty and dedicated to
the proposition that all men are created equal. Now we are engaged
in a great civil war, testing whether that nation or any nation
so conceived and so dedicated can long endure.

Sample Output

3 occurrences
and
nation

Submit

Source: Mid-Atlantic USA 2003