#K62047. Highest Frequency Character Count
Highest Frequency Character Count
Highest Frequency Character Count
Given a string \(S\) consisting of only lowercase letters, your task is to compute the frequency of the most frequent character in the string.
For example, if \(S = \texttt{abcaac}\), then the answer is 3 because the character 'a' appears 3 times.
You need to read the input from stdin and output the answer to stdout.
inputFormat
The input consists of a single line containing a non-empty string \(S\) (\(1 \leq |S| \leq 10^5\)) with only lowercase English letters.
outputFormat
Output a single integer which is the maximum frequency of any character in \(S\).
## sampleabcaac
3
</p>