






'''simple docstring'''
def        _a(     UpperCamelCase__ :  List[str]							):




      '''simple docstring'''






      SCREAMING_SNAKE_CASE__   : Any													=len(__UpperCAmelCase							)
      for _ in range(__UpperCAmelCase							):
            for i in range(_ % 2,		arr_size - 1,		2							):
                  if arr[i + 1] < arr[i]:
                        SCREAMING_SNAKE_CASE__   : Any													=arr[i + 1], arr[i]

      return arr


if __name__ == "__main__":
  a_ 		=       list(range(1_0, 0, -1))
  print(F'''Original: {arr}. Sorted: {odd_even_transposition(arr)}''')
"""simple docstring"""






__A			   = [
    (1_0_0_0, "M"),
    (9_0_0, "CM"),
    (5_0_0, "D"),
    (4_0_0, "CD"),
    (1_0_0, "C"),
    (9_0, "XC"),
    (5_0, "L"),
    (4_0, "XL"),
    (1_0, "X"),
    (9, "IX"),
    (5, "V"),
    (4, "IV"),
    (1, "I"),
]



def SCREAMING_SNAKE_CASE__			(   __UpperCAmelCase )  ->  int:
   lowercase__:   Dict					=      {'''I''': 1, '''V''': 5, '''X''': 1_0, '''L''': 5_0, '''C''': 1_0_0, '''D''': 5_0_0, '''M''': 1_0_0_0}
   lowercase__:   List[str]					=      0
   lowercase__:   List[Any]					=      0
   while place < len(__UpperCAmelCase ):
      if (place + 1 < len(__UpperCAmelCase )) and (vals[roman[place]] < vals[roman[place + 1]]):
         total += vals[roman[place + 1]] - vals[roman[place]]
         place += 2
      else:
         total += vals[roman[place]]
         place += 1
   return total



def SCREAMING_SNAKE_CASE__			(   __UpperCAmelCase )  ->  str:
   lowercase__:   Optional[Any]					=      []
   for arabic, roman in ROMAN:
      ((lowercase__), (lowercase__)):   Tuple					=      divmod(__UpperCAmelCase       ,    __UpperCAmelCase )
      result.append(roman * factor )
      if number == 0:
         break
   return "".join(__UpperCAmelCase )


if __name__ == "__main__":
       import doctest

       doctest.testmod()
