

'''simple docstring'''

from __future__ import annotations




def       UpperCamelCase(     UpperCAmelCase_  ,       UpperCAmelCase_	):
 # Checks if the entire collection has been sorted
 if len(UpperCAmelCase_	) <= 1 or n <= 1:
  return

 insert_next(UpperCAmelCase_  ,       n - 1	)
 rec_insertion_sort(UpperCAmelCase_  ,       n - 1	)




def       UpperCamelCase(     UpperCAmelCase_  ,       UpperCAmelCase_	):
 # Checks order between adjacent elements
 if index >= len(UpperCAmelCase_	) or collection[index - 1] <= collection[index]:
  return

 # Swaps adjacent elements since they are not in ascending order
 UpperCAmelCase       :	Union[str, Any]											= (
     collection[index],
     collection[index - 1],
 )

 insert_next(UpperCAmelCase_  ,       index + 1	)


if __name__ == "__main__":
 lowercase__			    =			input("Enter integers separated by spaces: ")
 lowercase__			    =			[int(num) for num in numbers.split()]
 rec_insertion_sort(number_list, len(number_list))
 print(number_list)










_UpperCAmelCase		:  Tuple	=   {str(digit): digit**5 for digit in range(10)}



def 					UpperCAmelCase__     (   lowerCamelCase      ):
  return sum(DIGITS_FIFTH_POWER[digit] for digit in str(lowerCamelCase      )      )



def 					UpperCAmelCase__     (   ):
  return sum(
      number
      for number in range(1000,	1000000      )
      if number == digits_fifth_powers_sum(lowerCamelCase      )      )


if __name__ == "__main__":
     print(solution())



