



'''simple docstring'''



def 							__UpperCAmelCase				(				UpperCamelCase__				:list			)		->						list:
				snake_case__      :   List[Any]      =    len(UpperCamelCase__			)
				for cycle_start in range(0   ,				array_len - 1			):
								snake_case__      :   Dict      =    array[cycle_start]

								snake_case__      :   Union[str, Any]      =    cycle_start
								for i in range(cycle_start + 1   ,				UpperCamelCase__			):
												if array[i] < item:
																pos += 1

								if pos == cycle_start:
												continue

								while item == array[pos]:
												pos += 1

								snake_case__  ,      snake_case__      :   Dict      =    item, array[pos]
								while pos != cycle_start:
												snake_case__      :   Optional[int]      =    cycle_start
												for i in range(cycle_start + 1   ,				UpperCamelCase__			):
																if array[i] < item:
																				pos += 1

												while item == array[pos]:
																pos += 1

												snake_case__  ,      snake_case__      :   str      =    item, array[pos]

				return array


if __name__ == "__main__":
				assert cycle_sort([4, 5, 3, 2, 1]) == [1, 2, 3, 4, 5]
				assert cycle_sort([0, 1, -10, 15, 2, -2]) == [-10, -2, 0, 1, 2, 15]








"""simple docstring"""


from math import factorial






def   a__			(					__lowercase  ,      __lowercase )						->						List[Any]:
				return factorial(__lowercase ) / (factorial(__lowercase ) * factorial(n - r ))






def   a__			(					)						->						List[str]:
				_A       	=      0

				for i in range(1  ,      101 ):
								for j in range(1  ,      i + 1 ):
												if combinations(__lowercase  ,      __lowercase ) > 1E6:
																total += 1
				return total


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