Lexicographical String Sorting

You are given a string s consisting of lowercase English letters. Your task is to sort the characters of the string in lexicographical order. In other words, you need to arrange the characters of s such that if we denote the sorted string as t, then t is the string formed by ordering the characters in ascending order.

The sorting operation is defined in the usual way, i.e., if we denote the characters as s[0], s[1], \dots, s[n-1], then after sorting, they will be rearranged as t[0] \leq t[1] \leq \dots \leq t[n-1]. This can be represented in \( \LaTeX \) as:

\( t = sort(s) \)

You need to read the input string from standard input and output the sorted string to standard output.

inputFormat

The input consists of a single line containing a string s composed of lowercase English letters. The string may be empty.

outputFormat

Output a single line which is the lexicographically sorted string.

programming

aggimmnoprr