




'''simple docstring'''





from __future__ import annotations


def 					UpperCamelCase_(     snake_case							:	list[int]					):

							'''simple docstring'''






							if len(snake_case					) == 0:
														return array

							snake_case_ ,				snake_case_      =				min(snake_case					), max(snake_case					)

							# Compute the variables
							snake_case_      =				_max - _min + 1
							snake_case_ ,				snake_case_      =				[0] * holes_range, [0] * holes_range

							# Make the sorting.
							for i in array:
														snake_case_      =				i - _min
														snake_case_      =				i
														holes_repeat[index] += 1

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

    # Returns the sorted array.
							return array


if __name__ == "__main__":
		import doctest

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










'''simple docstring'''





def 					UpperCamelCase_(     snake_case							:	int = 1_0_0_0					):

							'''simple docstring'''






							snake_case_      =				3
							snake_case_      =				0
							while a < n:
														if a % 3 == 0 or a % 5 == 0:
																					result += a
														elif a % 1_5 == 0:
																					result -= a
														a += 1
							return result


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




