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 sys\nfrom sys import stdout\n# from copy import copy, deepcopy\n# from functools import lru_cache\n# from string import ascii_lowercase\n# from math import inf\n# inf = float(\'inf\')\n\n\ndef main():\n    ans = solve_case()\n    stdout.write("{}\\n".format(ans))\n\ndef solve_case():\n    S = read_str()\n\n    len_s = len(S)\n    int_s = [ord(c) - ord(\'a\') for c in S]\n\n    # next_char_pos[from_idx][letter_idx] := the position of the next letter `letter_idx` from `from_idx`\n    next_char_pos = make_list((len_s + 1, 26), len_s)\n    for from_idx in reversed(list(range(len_s))):\n        for letter_idx in range(26):\n            if int_s[from_idx] == letter_idx:\n                pos = from_idx\n            else:\n                pos = next_char_pos[from_idx+1][letter_idx]\n            next_char_pos[from_idx][letter_idx] = pos\n\n    # non_subseq_len[from_idx] := the length of the shortest "non subsequence" in S[from_idx:]\n    non_subseq_len = make_list([len_s + 2], len_s + 1)\n    non_subseq_len[len_s] = 1\n    non_subseq_len[len_s + 1] = 0\n    ans_next_pos = make_list([len_s + 1], len_s)\n    ans_letter = make_list([len_s + 1], -1)\n    for from_idx in reversed(list(range(len_s))):\n        for letter_idx in range(26):\n            new_len = non_subseq_len[next_char_pos[from_idx][letter_idx] + 1] + 1\n            if non_subseq_len[from_idx] > new_len:\n                non_subseq_len[from_idx] = new_len\n                ans_letter[from_idx] = letter_idx\n                ans_next_pos[from_idx] = next_char_pos[from_idx][letter_idx] + 1\n\n    ans = \'\'\n    idx = 0\n    while idx < len(S):\n        ans += chr(ord(\'a\') + ans_letter[idx])\n        idx = ans_next_pos[idx]\n    return ans\n\n#################################\n\ndef read_str(): return input()\ndef read_int(): return int(input())\ndef read_str_list(): return input().split(\' \')\ndef read_int_list(): return list(map(int, input().split(\' \')))\ndef read_lines(n, read_func): return [read_func() for _ in range(n)]\ndef list_to_str(l, sep=\' \'): return sep.join(map(str, l))\nl2s = list_to_str\n# shape: tuple of ints | list of ints\ndef make_list(shape, value=None):\n    if len(shape) == 1:\n        return [value] * shape[0]\n    return [make_list(shape[1:], value) for _ in range(shape[0])]\n\ndef __starting_point():\n    # sys.setrecursionlimit(1000000)\n    main()\n\n__starting_point()'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 16203