

"""simple docstring"""





from __future__ import annotations




def   _A  (  UpperCamelCase_     :       list[int])	->						list[int]:
   '''simple docstring'''


   if len(UpperCamelCase_) == 0:
      return array

   __lowercase		,__lowercase								=						min(UpperCamelCase_), max(UpperCamelCase_)

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

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

   # Makes the array back by replacing the numbers.
   __lowercase								=						0
   for i in range(UpperCamelCase_):
      while holes_repeat[i] > 0:
         __lowercase								=						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))







from multiprocessing import Lock, Pipe, Process

# lock used to ensure that two processes do not access a pipe at the same time
_lowerCAmelCase					:			Optional[Any]  				=			Lock()






def        UpperCamelCase_(							_snake_case   :  List[str]       ,     _snake_case   :  Optional[int]       ,     _snake_case   :  Dict       ,     _snake_case   :  Any       ,     _snake_case   :  List[str]       ,     _snake_case   :  Tuple       ,     _snake_case   :  List[str]	):




			"""simple docstring"""






			global process_lock

			# we perform n swaps since after n swaps we know we are sorted
			# we *could* stop early if we are sorted already, but it takes as long to
			# find out we are sorted as it does to sort the list with this algorithm
			for i in range(0       ,     10	):
						if (i + position) % 2 == 0 and r_send is not None:
									# send your value to your right neighbor
									process_lock.acquire()
									r_send[1].send(_snake_case	)
									process_lock.release()

									# receive your right neighbor's value
									process_lock.acquire()
									__a        =rr_cv[0].recv()
									process_lock.release()

									# take the lower value since you are on the left
									__a        =min(_snake_case       ,     _snake_case	)
						elif (i + position) % 2 != 0 and l_send is not None:
									# send your value to your left neighbor
									process_lock.acquire()
									l_send[1].send(_snake_case	)
									process_lock.release()

									# receive your left neighbor's value
									process_lock.acquire()
									__a        =lr_cv[0].recv()
									process_lock.release()

									# take the higher value since you are on the right
									__a        =max(_snake_case       ,     _snake_case	)
    # after all swaps are performed, send the values back to main
			result_pipe[1].send(_snake_case	)






def        UpperCamelCase_(							_snake_case   :  List[str]	):




			"""simple docstring"""






			__a        =[]
			__a        =[]
			# initialize the list of pipes where the values will be retrieved
			for _ in arr:
						result_pipe.append(Pipe()	)
			# creates the processes
			# the first and last process only have one neighbor so they are made outside
			# of the loop
			__a        =Pipe()
			__a        =Pipe()
			process_array_.append(
			    Process(
			        target=_snake_case       ,     args=(0, arr[0], None, temp_rs, None, temp_rr, result_pipe[0])       ,     )	)
			__a        =temp_rs
			__a        =temp_rr

			for i in range(1       ,     len(_snake_case	) - 1	):
						__a        =Pipe()
						__a        =Pipe()
						process_array_.append(
						    Process(
						        target=_snake_case       ,     args=(i, arr[i], temp_ls, temp_rs, temp_lr, temp_rr, result_pipe[i])       ,     )	)
						__a        =temp_rs
						__a        =temp_rr

			process_array_.append(
			    Process(
			        target=_snake_case       ,     args=(
			            len(_snake_case	) - 1,
			            arr[len(_snake_case	) - 1],
			            temp_ls,
			            None,
			            temp_lr,
			            None,
			            result_pipe[len(_snake_case	) - 1],
			        )       ,     )	)

			# start the processes
			for p in process_array_:
						p.start()

			# wait for the processes to end and write their values to the list
			for p in range(0       ,     len(_snake_case	)	):
						__a        =result_pipe[p][0].recv()
						process_array_[p].join()
			return arr






def        UpperCamelCase_(							):




			"""simple docstring"""






			__a        =list(range(10       ,     0       ,     -1	)	)
			print('Initial List'	)
			print(*_snake_case	)
			__a        =odd_even_transposition(_snake_case	)
			print('Sorted List\n'	)
			print(*_snake_case	)


if __name__ == "__main__":
						main()






