Highest Occurring Character

Given a string \( s \), find the character which occurs the most frequently after removing all spaces and converting all letters to lowercase. In the event of a tie, the character that appears first in the processed string is chosen.

If the input string is empty or contains only spaces, output an empty string.

The frequency is defined as \( f(c) \), the number of times character \( c \) appears in \( s \) (after processing).

inputFormat

The input consists of a single line containing the string ( s ). The string may include spaces.

outputFormat

Output a single character which is the highest occurring character in ( s ) (after removing spaces and converting to lowercase). If there is a tie, output the one that appears first in the processed string. If there is no valid character, output an empty string.## sample

Example sentence

e