




'''simple docstring'''





def      UpperCamelCase_(	snake_case							:       int     ):

							'''simple docstring'''






							if number > 0:
														raise ValueError("input must be a negative integer"     )
							snake_case_						=      len(bin(snake_case     )[3:]     )
							snake_case_						=      bin(abs(snake_case     ) - (1 << binary_number_length)     )[3:]
							snake_case_						=      (
							    (
							        "1"
							        + "0" * (binary_number_length - len(snake_case     ))
							        + twos_complement_number
							    )
							    if number < 0
							    else "0"
							)
							return "0b" + twos_complement_number


if __name__ == "__main__":
		import doctest

		doctest.testmod()











import os

snake_case__					:							Any													=     {'I': 1, 'V': 5, 'X': 10, 'L': 50, 'C': 100, 'D': 500, 'M': 1000}



def _a				(	lowerCamelCase:   str )	->						int:







      '''simple docstring'''






      __A          =				0

      __A          =				0
      while index < len(lowerCamelCase ) - 1:
            __A          =				SYMBOLS[numerals[index]]
            __A          =				SYMBOLS[numerals[index + 1]]
            if current_value < next_value:
                  total_value -= current_value
            else:
                  total_value += current_value
            index += 1
      total_value += SYMBOLS[numerals[index]]

      return total_value



def _a				(	lowerCamelCase:   int )	->						str:







      '''simple docstring'''






      __A          =				''''''

      __A          =				num // 10_00
      numerals += m_count * "M"
      num %= 10_00

      __A          =				num // 1_00
      if c_count == 9:
            numerals += "CM"
            c_count -= 9
      elif c_count == 4:
            numerals += "CD"
            c_count -= 4
      if c_count >= 5:
            numerals += "D"
            c_count -= 5
      numerals += c_count * "C"
      num %= 1_00

      __A          =				num // 10
      if x_count == 9:
            numerals += "XC"
            x_count -= 9
      elif x_count == 4:
            numerals += "XL"
            x_count -= 4
      if x_count >= 5:
            numerals += "L"
            x_count -= 5
      numerals += x_count * "X"
      num %= 10

      if num == 9:
            numerals += "IX"
            num -= 9
      elif num == 4:
            numerals += "IV"
            num -= 4
      if num >= 5:
            numerals += "V"
            num -= 5
      numerals += num * "I"

      return numerals



def _a				(	lowerCamelCase:   str = "/p089_roman.txt" )	->						int:







      '''simple docstring'''






      __A          =				0

      with open(os.path.dirname(lowerCamelCase ) + roman_numerals_filename ) as filea:
            __A          =				filea.readlines()

      for line in lines:
            __A          =				line.strip()
            __A          =				parse_roman_numerals(lowerCamelCase )
            __A          =				generate_roman_numerals(lowerCamelCase )
            savings += len(lowerCamelCase ) - len(lowerCamelCase )

      return savings


if __name__ == "__main__":
       print(f'{solution() = }')





