Deep in the lakeside town of Mirrormere, Tinker studies rows of sigils entries. One clean number will settle the guild's oldest argument. Task: Read a lowercase string s and print the character that occurs most often. If several tie, print the alphabetically smallest. Input format: One line with a single lowercase string s. Output format: Print a single character. Constraints: 1 <= |s| <= 1950; s contains lowercase English letters.
Example 1:
Example 2:
Example 3:
Constraints:
1 <= |s| <= 1950; s contains lowercase English letters.
