{"trustable":true,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003eAyoub has a string $$$S$$$ consists of only lower case Latin letters, and he wants you to make some operations on it:\u003c/p\u003e\u003col\u003e \u003cli\u003e you can swap any two characters in the string. \u003c/li\u003e\u003cli\u003e you can delete any two adjacent characters that have the same value and replace them with the next character alphabetically,for example string $$$\"abbx\"$$$ could be $$$\"acx\"$$$ after one operation, string $$$\"zz\"$$$ could not be changed; because z is the last character in the English alphabets. \u003c/li\u003e\u003c/ol\u003e\u003cp\u003eAyoub wants you to make the string lexicographically maximal using the mentioned operations as many times as you want, can you help him?\u003c/p\u003e\u003cp\u003eString $$$x \u003d x_1x_2... x_{|x|}$$$ is lexicographically larger than string $$$y \u003d y_1y_2... y_{|y|}$$$, if either $$$|x| \u0026gt; |y|$$$ and $$$x_1 \u003d y_1, x_2 \u003d y_2, ... , x_{|y|}\u003d y_{|y|}$$$, or exists such number $$$r (r \u0026lt; |x|, r \u0026lt; |y|)$$$, that $$$x_1 \u003d y_1, x_2 \u003d y_2, ... , x_r \u003d y_r$$$ and $$$x_r + 1 \u0026gt; y_r + 1$$$. Characters in lines are compared like their ASCII codes.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe input contains a single string $$$S$$$ $$$(1 \\leq |S| \\leq 10^5)$$$.\u003c/p\u003e\u003cp\u003eIt is guaranteed that string $$$S$$$ consists of only lower case Latin letters.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eprint the lexicographically maximal string that could be obtained using these two operations.\u003c/p\u003e"}},{"title":"Examples","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003eabbx\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003exca\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003ezyayz\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003ezzza\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eIn the first test case Ayoub replaced $$$\"bb\"$$$ with $$$\"c\"$$$ so the string has been changed to $$$\"acx\"$$$, then he swapped \u0027a\u0027 with \u0027x\u0027 so the result is $$$\"xca\"$$$ and it is the lexicographically maximal string.\u003c/p\u003e"}}]}