Lexicographically Smallest String

You are given a string s. Transform the string into the lexicographically smallest string possible by rearranging its characters. In simple terms, your task is to sort the characters of the string in ascending order.

The lexicographical order follows the usual dictionary order. Formally, if we denote the sorted string as t, then:

\( t = \text{sort}(s) \)

where \( \text{sort}(s) \) is the string that contains all characters of \( s \) arranged in increasing order.

Note: The input will be provided through standard input (stdin) and the result must be printed to standard output (stdout).

inputFormat

The input consists of a single line containing a non-empty string s composed of uppercase or lowercase English letters.

Input is read from standard input (stdin).

outputFormat

Output the lexicographically smallest string that can be formed by reordering the characters of s. Output this string to standard output (stdout).

BCDA

ABCD