{"raw_statement":[{"iden":"problem statement","content":"You are given a string $S$. Find the lexicographically smallest string $S'$ obtained by permuting the characters of $S$.\nHere, for different two strings $s = s_1 s_2 \\ldots s_n$ and $t = t_1 t_2 \\ldots t_m$, $s \\lt t$ holds lexicographically when one of the conditions below is satisfied.\n\n*   There is an integer $i\\ (1 \\leq i \\leq \\min(n,m))$ such that $s_i \\lt t_i$ and $s_j=t_j$ for all integers $j\\ (1 \\leq j \\lt i)$.\n*   $s_i = t_i$ for all integers $i\\ (1 \\leq i \\leq \\min(n,m))$, and $n \\lt m$."},{"iden":"constraints","content":"*   $S$ is a string of length between $1$ and $2 \\times 10^5$ (inclusive) consisting of lowercase English letters."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$"},{"iden":"sample input 1","content":"aba"},{"iden":"sample output 1","content":"aab\n\nThree strings can be obtained by permuting `aba`:\n\n*   `aba`\n*   `aab`\n*   `baa`\n\nThe lexicographically smallest among them is `aab`."},{"iden":"sample input 2","content":"zzzz"},{"iden":"sample output 2","content":"zzzz"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}