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.

-----Sample Input-----
atcoderregularcontest

-----Sample Output-----
b

The string atcoderregularcontest contains a as a subsequence, but not b.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'import os\nimport sys\n\nif os.getenv("LOCAL"):\n    sys.stdin = open("_in.txt", "r")\n\nsys.setrecursionlimit(2147483647)\nINF = float("inf")\nIINF = 10 ** 18\nMOD = 10 ** 9 + 7\n\nS = sys.stdin.readline().rstrip()\nA = [ord(c) - ord(\'a\') for c in S]\nN = len(S)\n\n# 答えの文字列の長さ\nl = 0\n# その文字以降で、何文字までの任意文字列を作れるか\nlengths = [0] * N\ncounts = [0] * 26\nfor i, a in reversed(list(enumerate(A))):\n    counts[a] += 1\n    lengths[i] = l\n    if min(counts) == 1:\n        counts = [0] * 26\n        l += 1\nans_size = l + 1\n\n# 文字ごとの次のインデックス\ngraph = [[-1] * 26 for _ in range(N)]\npos = [-1] * 26\nfor i, a in reversed(list(enumerate(A))):\n    graph[i] = pos[:]\n    pos[a] = i\ninitials = pos\n\n\ndef solve(size, i=None):\n    # i 番目から始まり、長さ size である、部分列でない文字列\n    if i is None:\n        pos = initials\n    else:\n        pos = graph[i]\n\n    if size == 1:\n        return chr(pos.index(-1) + ord(\'a\'))\n\n    size -= 1\n    for ci, i in enumerate(pos):\n        if lengths[i] < size:\n            c = chr(ci + ord(\'a\'))\n            return c + solve(size, i)\n    assert False\n\n\nprint((solve(ans_size)))\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 14817