






def  a__ (__lowercase							:list[int]   )		-> Optional[Any]:
				if not numbers:
								return 0

				if not isinstance(_UpperCamelCase					,  (list, tuple)   ) or not all(
				    isinstance(_UpperCamelCase					,  _UpperCamelCase   ) for number in numbers   ):
								raise ValueError('''numbers must be an iterable of integers'''   )

				_A	:				List[str]   =      numbers[0]

				for i in range(1					,  len(_UpperCamelCase   )   ):
								# update the maximum and minimum subarray products
								_A	:				List[Any]   =      numbers[i]
								if number < 0:
												_A  ,				_A	:				Optional[int]   =      min_till_now, max_till_now
								_A	:				Optional[Any]   =      max(_UpperCamelCase					,  max_till_now * number   )
								_A	:				int   =      min(_UpperCamelCase					,  min_till_now * number   )

								# update the maximum product found till now
								_A	:				str   =      max(_UpperCamelCase					,  _UpperCamelCase   )

				return max_prod








a_								=       {
    0: """0""",
    1: """1""",
    2: """2""",
    3: """3""",
    4: """4""",
    5: """5""",
    6: """6""",
    7: """7""",
    8: """8""",
    9: """9""",
    10: """a""",
    11: """b""",
    12: """c""",
    13: """d""",
    14: """e""",
    15: """f""",
}





def 		a__      (		_UpperCamelCase      :			float				):
   assert type(_UpperCamelCase				) in (int, float) and decimal == int(_UpperCamelCase				)
   __lowerCamelCase    				=     int(_UpperCamelCase				)
   __lowerCamelCase    				=     ''''''
   __lowerCamelCase    				=     False
   if decimal < 0:
      __lowerCamelCase    				=     True
      decimal *= -1
   while decimal > 0:
      __lowerCamelCase				,__lowerCamelCase    				=     divmod(_UpperCamelCase			,16				)
      __lowerCamelCase    				=     values[remainder] + hexadecimal
   __lowerCamelCase    				=     '''0x''' + hexadecimal
   if negative:
      __lowerCamelCase    				=     '''-''' + hexadecimal
   return hexadecimal


if __name__ == "__main__":
  import doctest

  doctest.testmod()






