



'''simple docstring'''






from math import factorial

UpperCamelCase__:   Union[str, Any]								=			{str(d): factorial(d) for d in range(10)}


def  snake_case_     (					_lowerCAmelCase  :						int  )      ->   int:
							return sum(DIGIT_FACTORIAL[d] for d in str(_lowerCAmelCase  )  )


def  snake_case_     (					)      ->   int:
							UpperCAmelCase :       Tuple 							=		7 * factorial(9  ) + 1
							return sum(i for i in range(3   ,      _lowerCAmelCase  ) if sum_of_digit_factorial(_lowerCAmelCase  ) == i  )


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










'''simple docstring'''






from __future__ import annotations


def  snake_case_     (					_lowerCAmelCase  :						list[int | float]   ,      _lowerCAmelCase  :						int   ,      _lowerCAmelCase  :						int  )      ->   int | float:
							if len(_lowerCAmelCase  ) == 0:
														raise ValueError('''find_max() arg is an empty sequence'''  )
							if (
							    left >= len(_lowerCAmelCase  )
							    or left < -len(_lowerCAmelCase  )
							    or right >= len(_lowerCAmelCase  )
							    or right < -len(_lowerCAmelCase  )
							):
														raise IndexError('''list index out of range'''  )
							if left == right:
														return nums[left]
							UpperCAmelCase :       List[Any] 							=		(left + right) >> 1  # the middle
							UpperCAmelCase :       Optional[Any] 							=		find_max(_lowerCAmelCase   ,      _lowerCAmelCase   ,      _lowerCAmelCase  )  # find max in range[left, mid]
							UpperCAmelCase :       Dict 							=		find_max(_lowerCAmelCase   ,      mid + 1   ,      _lowerCAmelCase  )  # find max in range[mid + 1, right]

							return left_max if left_max >= right_max else right_max


if __name__ == "__main__":
						import doctest

						doctest.testmod(verbose=True)





