Lexicographically Smallest Permutation

Given a single word, your task is to compute its lexicographically smallest permutation by reordering its characters in ascending order. In other words, sort the letters of the string in non-decreasing order.

Input: A single string consisting of lowercase letters.

Output: The sorted string which represents the lexicographically smallest permutation of the input.

For example, if the input is "cba", the output should be "abc".

inputFormat

The input consists of a single line containing a string s with 1 ≤ |s| ≤ 10⁵, consisting of only lowercase letters.

outputFormat

Output the lexicographically smallest permutation of the given string.

cba

abc