




def        _SCREAMING_SNAKE_CASE      (		snake_case       )						->				List[Any]:
						assert isinstance(UpperCamelCase__			,     UpperCamelCase__       ), f"The input value of [n={number}] is not an integer"

						if number == 1:
												return 2
						elif number < 1:
												_UpperCAmelCase      =			f"The input value of [n={number}] has to be > 0"
												raise ValueError(UpperCamelCase__       )
						else:
												_UpperCAmelCase      =			sylvester(number - 1       )
												_UpperCAmelCase      =			num - 1
												_UpperCAmelCase      =			num
												return lower * upper + 1


if __name__ == "__main__":
				print(F'The 8th number in Sylvester\'s sequence: {sylvester(8)}')





from __future__ import annotations




def        _SCREAMING_SNAKE_CASE      (		snake_case       )						->				list[int]:
						if len(snake_case       ) == 0:
												return array

						_UpperCAmelCase    ,					_UpperCAmelCase      =			min(snake_case       ), max(snake_case       )

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

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

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

    # Returns the sorted array.
						return array


if __name__ == "__main__":
				import doctest

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