Problem Statement

A subsequence of a string $S$ is a string that can be obtained by deleting zero or more characters from $S$ without changing the order of the remaining characters. For example, arc, artistic and (an empty string) are all subsequences of artistic; abc and ci are not.

You are given a string $A$ consisting of lowercase English letters. Find the shortest string among the strings consisting of lowercase English letters that are not subsequences of $A$. If there are more than one such string, find the lexicographically smallest one among them.

Constraints

• $1 \leq |A| \leq 2 \times 10^5$
• $A$ consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

A

Output

Print the lexicographically smallest string among the shortest strings consisting of lowercase English letters that are not subsequences of $A$.