





a__:      Tuple									=		[
    (1_000, 'M'),
    (900, 'CM'),
    (500, 'D'),
    (400, 'CD'),
    (100, 'C'),
    (90, 'XC'),
    (50, 'L'),
    (40, 'XL'),
    (10, 'X'),
    (9, 'IX'),
    (5, 'V'),
    (4, 'IV'),
    (1, 'I'),
]


def 	UpperCamelCase__(       UpperCamelCase__			:       str  )->Any:
       A__											=						{"I": 1, "V": 5, "X": 10, "L": 50, "C": 1_00, "D": 5_00, "M": 10_00}
       A__											=						0
       A__											=						0
       while place < len(_lowerCamelCase  ):
              if (place + 1 < len(_lowerCamelCase  )) 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 	UpperCamelCase__(       UpperCamelCase__			:       int  )->List[Any]:
       A__											=						[]
       for arabic, roman in ROMAN:
              (A__)											=						divmod(_lowerCamelCase ,     _lowerCamelCase  )
              result.append(roman * factor  )
              if number == 0:
                     break
       return "".join(_lowerCamelCase  )


if __name__ == "__main__":
       import doctest

       doctest.testmod()






def 			lowercase_				(			_lowerCamelCase							:       int):
    lowercase__ :   Dict    					=				n ** (1 / 3)
    return (val * val * val) == n


if __name__ == "__main__":
      print(perfect_cube(27))
      print(perfect_cube(4))



