Most Frequent Character

Given a string s, your task is to find the character that occurs most frequently. If there are multiple characters with the same maximum frequency, output the lexicographically smallest one.

Formally, let \(f(c)\) be the number of times character \(c\) appears in \(s\). You need to find the character \(c\) such that \(f(c)\) is maximized, and if more than one character satisfies this condition, choose the one with the smallest ASCII value.

inputFormat

The input consists of a single line, which contains a non-empty string \(s\). You are guaranteed that \(s\) contains at most 10,000 characters.

outputFormat

Output a single character that is the most frequent in the string \(s\). In case of a tie, print the lexicographically smallest character.

a

a