Submit solution

Points:
5

Time limit:
1.0s

Memory limit:
32M

Problem type

Allowed languages

Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, ~~CommonLisp~~, D, Dart, F#, Forth, Fortran, Go, ~~Groovy~~, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, ~~Nim~~, ~~ObjC~~, OCaml, ~~Octave~~, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig

Using roman numerals the numbers are written as `I`

, `II`

,
`III`

, `IV`

, `V`

, `VI`

, `VII`

, `VIII`

, `IX`

. Numbers are
written as `X`

, `XX`

, `XXX`

, `XL`

, `L`

, `LX`

, `LXX`

, `LXXX`

, `XC`

.

Any number smaller than can be written by converting tens and ones
separately and concatenating the results. So, for example, the number
would be written as `XLVIII`

, `XL`

for and `VIII`

for .

Given a number written in roman numerals, rearrange its characters so that you create the smallest possible number, written in roman numerals.

#### Input

The first and only line of input contains one integer , written using roman numerals.

#### Output

The first and only line of output should contain a rearrangement of input characters so that it represents the smallest possible number, written in roman numerals.

#### Sample Input 1

`VII`

#### Sample Output 1

`VII`

#### Sample Input 2

`VI`

#### Sample Output 2

`IV`

#### Sample Input 3

`III`

#### Sample Output 3

`III`

## Comments