


'''simple docstring'''




from __future__ import annotations

def 			__UpperCamelCase    (    _A    :				list[int]				)    ->      list[int]:




	"""simple docstring"""





	if len(_lowerCamelCase				) == 0:
		return array

	lowerCAmelCase					:    Optional[int]      							= min(_lowerCamelCase				), max(_lowerCamelCase				)

	# Compute the variables
	lowerCAmelCase					:    Any      							= _max - _min + 1
	lowerCAmelCase					:    List[str]      							= [0] * holes_range, [0] * holes_range

	# Make the sorting.
	for i in array:
		lowerCAmelCase					:    Union[str, Any]      							= i - _min
		lowerCAmelCase					:    str      							= i
		holes_repeat[index] += 1

	# Makes the array back by replacing the numbers.
	lowerCAmelCase					:    List[Any]      							= 0
	for i in range(_lowerCamelCase				):
		while holes_repeat[i] > 0:
			lowerCAmelCase					:    Tuple      							= holes[i]
			index += 1
			holes_repeat[i] -= 1

    # Returns the sorted array.
	return array


if __name__ == "__main__":
				import doctest

				doctest.testmod()
				_lowerCAmelCase  :		Any		     =	input('Enter numbers separated by comma:\n')
				_lowerCAmelCase  :		str		     =	[int(x) for x in user_input.split(',')]
				print(pigeon_sort(unsorted))





'''simple docstring'''




_lowerCAmelCase  :		List[str]		     =	{str(digit): digit**5 for digit in range(10)}

def 			__UpperCamelCase    (    _A    :				int				)    ->      int:




	"""simple docstring"""





	return sum(DIGITS_FIFTH_POWER[digit] for digit in str(_A				)				)

def 			__UpperCamelCase    (    )    ->      int:




	"""simple docstring"""





	return sum(
	    number
	    for number in range(10_00					,   1_00_00_00				)
	    if number == digits_fifth_powers_sum(_A				)				)


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