{"trustable":false,"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\u003eGiven a string \u003cvar\u003eS\u003c/var\u003e you need to to make some operations on it:\u003c/p\u003e\n\u003col\u003e \u003cli\u003e Swap any two characters in the string. \u003c/li\u003e\n\u003cli\u003e Replace any two adjacent characters if they are equal with the next character alphabetically ,for example \u003cvar\u003eabbx\u003c/var\u003e can be \u003cvar\u003eacx\u003c/var\u003e, however \u003cvar\u003ezz\u003c/var\u003e can\u0027t be changed; because z is the last character in the English alphabets. \u003c/li\u003e\u003c/ol\u003e\n\u003cp\u003eWhat is the lexicographically largest that can be made using these operatons?\u003c/p\u003e\u003cp\u003eA string \u003cvar\u003eS\u003c/var\u003e is lexicographically smaller than string \u003cvar\u003eS\u0027\u003c/var\u003e if \u003cvar\u003eS\u003c/var\u003e is a prefix of \u003cvar\u003eS\u0027\u003c/var\u003e or there exists a character in \u003cvar\u003eS\u003c/var\u003e smaller than the one in \u003cvar\u003eS\u0027\u003c/var\u003e at the first position they differ in.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe input contains a single string \u003cvar\u003eS\u003c/var\u003e, where 1 \u003c\u003d \u003cvar\u003e|S|\u003c/var\u003e \u003c\u003d 10\u003csup\u003e5\u003c/sup\u003e.\u003c/p\u003e\u003cp\u003eIt is guaranteed that string \u003cvar\u003eS\u003c/var\u003e consists of only lower case Latin letters.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eprint the lexicographically largest string that could be obtained using these two operations.\u003c/p\u003e"}},{"title":"Sample 1","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\nA possible way to get the answer is: \u003cbr\u003e\n\u003cvar\u003eabbx\u003c/var\u003e -\u003e \u003cvar\u003exbba\u003c/var\u003e\u003cbr\u003e\n\u003cvar\u003exbba\u003c/var\u003e -\u003e \u003cvar\u003exca\u003c/var\u003e"}},{"title":"Sample 2","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"}}]}