You are given a string of lowercase alphabets. Now you need to remove all the instances of exactly one type of character such that the new string that is formed is lexicographically smallest across all the other strings that can be formed in a similar way.
For example: Let the string be "appleap"
So among all the newly formed strings , alea is lexicographically smallest string.
Note : Lexicographically smallest means the string that would appear before all the strings if they were arranged in the order of words appearing in a dictionary.
Input
First line contains a string as input
Output
Print the lexicographically smallest string that can be formed using the process above
Constraints
where is the length of string
The string will contain atleast two distinct characters.
The sample is explained in the problem statement.