


from math import factorial

_snake_case             =     {str(d): factorial(d) for d in range(10)}






def 		lowercase_(  SCREAMING_SNAKE_CASE_	):


  '''simple docstring'''

  return sum(DIGIT_FACTORIAL[d] for d in str(SCREAMING_SNAKE_CASE_	)	)






def 		lowercase_(  ):


  '''simple docstring'''

  lowerCamelCase :					List[str]    =				7 * factorial(9	) + 1
  return sum(i for i in range(3      ,						SCREAMING_SNAKE_CASE_	) if sum_of_digit_factorial(SCREAMING_SNAKE_CASE_	) == i	)


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







def 		lowercase_(  SCREAMING_SNAKE_CASE_	):


  '''simple docstring'''

  for i in range(len(SCREAMING_SNAKE_CASE_	) - 1      ,						0      ,						-1	):
    lowerCamelCase :					Tuple    =				False

    for j in range(SCREAMING_SNAKE_CASE_      ,						0      ,						-1	):
      if unsorted[j] < unsorted[j - 1]:
        lowerCamelCase    ,	lowerCamelCase :					int    =				unsorted[j - 1], unsorted[j]
        lowerCamelCase :					Optional[int]    =				True

    for j in range(SCREAMING_SNAKE_CASE_	):
      if unsorted[j] > unsorted[j + 1]:
        lowerCamelCase    ,	lowerCamelCase :					Union[str, Any]    =				unsorted[j + 1], unsorted[j]
        lowerCamelCase :					Optional[Any]    =				True

    if not swapped:
      break
  return unsorted


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   _snake_case             =     input('''Enter numbers separated by a comma:\n''').strip()
   _snake_case             =     [int(item) for item in user_input.split(''',''')]
   print(f'''{cocktail_shaker_sort(unsorted) = }''')



