



"""simple docstring"""

from typing import TYPE_CHECKING

from ...utils import (
    OptionalDependencyNotAvailable,
    _LazyModule,
    is_torch_available,
)


A_						:    str				=      {
    'configuration_swiftformer': [
        'SWIFTFORMER_PRETRAINED_CONFIG_ARCHIVE_MAP',
        'SwiftFormerConfig',
        'SwiftFormerOnnxConfig',
    ]
}

try:
							if not is_torch_available():
														raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
							pass
else:
							A_						:    List[Any]				=      [
							    'SWIFTFORMER_PRETRAINED_MODEL_ARCHIVE_LIST',
							    'SwiftFormerForImageClassification',
							    'SwiftFormerModel',
							    'SwiftFormerPreTrainedModel',
							]

if TYPE_CHECKING:
							from .configuration_swiftformer import (
							    SWIFTFORMER_PRETRAINED_CONFIG_ARCHIVE_MAP,
							    SwiftFormerConfig,
							    SwiftFormerOnnxConfig,
							)

							try:
														if not is_torch_available():
																					raise OptionalDependencyNotAvailable()
							except OptionalDependencyNotAvailable:
														pass
							else:
														from .modeling_swiftformer import (
														    SWIFTFORMER_PRETRAINED_MODEL_ARCHIVE_LIST,
														    SwiftFormerForImageClassification,
														    SwiftFormerModel,
														    SwiftFormerPreTrainedModel,
														)

else:
							import sys

							A_						:    List[Any]				=      _LazyModule(__name__, globals()['__file__'], _import_structure, module_spec=__spec__)










"""simple docstring"""

from __future__ import annotations
def  __snake_case							(	__A      :						list[int]     )     ->       list[int]:






				'''simple docstring'''
				if len(__A     ) == 0:
								return array

				SCREAMING_SNAKE_CASE				,						SCREAMING_SNAKE_CASE						:							Optional[int]							=     min(__A     ), max(__A     )

				# Compute the variables
				SCREAMING_SNAKE_CASE						:							Optional[int]							=     _max - _min + 1
				SCREAMING_SNAKE_CASE				,						SCREAMING_SNAKE_CASE						:							List[str]							=     [0] * holes_range, [0] * holes_range

				# Make the sorting.
				for i in array:
								SCREAMING_SNAKE_CASE						:							List[Any]							=     i - _min
								SCREAMING_SNAKE_CASE						:							Dict							=     i
								holes_repeat[index] += 1

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

    # Returns the sorted array.
				return array


if __name__ == "__main__":
							import doctest

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





