eolymp
bolt
Try our new interface for solving problems
Problems

Ordering

Ordering

Time limit 1 second
Memory limit 128 MiB

A string of lowercase Latin letters is given. Print all its letters in alphabetical order (in ascending order of ASCII codes).

Input data

One line consisting of no more than 200 lowercase Latin letters.

Output data

Print all letters of the string in alphabetical order.

Examples

Input example #1
abrakadabra
Output example #1
aaaaabbdkrr
Author Matviychuk Sergiy Volodymyrovych
Source "ABC programming"