Most Frequent Character

Given a string \( S \) consisting of both lowercase and uppercase English alphabet characters, determine the frequency of the most occurring character in the string.

In other words, if we define \( f(c) \) as the number of times a character \( c \) appears in \( S \), you are required to compute

[ \max_{c \in S} ; f(c). ]

The program should read the input string from standard input (stdin) and output the computed maximum frequency to standard output (stdout).

Example:

Input: aabBBcc
Output: 2

inputFormat

The input consists of a single line containing the string \( S \). The string \( S \) can include both lowercase and uppercase English letters.

outputFormat

Output a single integer, which is the maximum frequency of any character in the string \( S \).

aabBBcc

2