



'''simple docstring'''

from multiprocessing import Lock, Pipe, Process

# lock used to ensure that two processes do not access a pipe at the same time
__lowerCAmelCase						      =       Lock()



def 					__lowerCamelCase					(				lowerCAmelCase_						,      lowerCAmelCase_						,      lowerCAmelCase_						,      lowerCAmelCase_						,      lowerCAmelCase_						,      lowerCAmelCase_						,      lowerCAmelCase_  )      ->				Any:
		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(lowerCAmelCase_  )
						process_lock.release()

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

						# take the lower value since you are on the left
						_a					:				Union[str, Any]				=							min(lowerCAmelCase_						,      lowerCAmelCase_  )
				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(lowerCAmelCase_  )
						process_lock.release()

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

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



def 					__lowerCamelCase					(				lowerCAmelCase_  )      ->				Dict:
		_a					:				Optional[Any]				=							[]
		_a					:				int				=							[]
		# 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					:				Tuple				=							Pipe()
		_a					:				Optional[int]				=							Pipe()
		process_array_.append(
		    Process(
		        target=lowerCAmelCase_						,      args=(0, arr[0], None, temp_rs, None, temp_rr, result_pipe[0])						,      )  )
		_a					:				Union[str, Any]				=							temp_rs
		_a					:				Optional[int]				=							temp_rr

		for i in range(1						,      len(lowerCAmelCase_  ) - 1  ):
				_a					:				Dict				=							Pipe()
				_a					:				Optional[Any]				=							Pipe()
				process_array_.append(
				    Process(
				        target=lowerCAmelCase_						,      args=(i, arr[i], temp_ls, temp_rs, temp_lr, temp_rr, result_pipe[i])						,      )  )
				_a					:				Dict				=							temp_rs
				_a					:				List[str]				=							temp_rr

		process_array_.append(
		    Process(
		        target=lowerCAmelCase_						,      args=(
		            len(lowerCAmelCase_  ) - 1,
		            arr[len(lowerCAmelCase_  ) - 1],
		            temp_ls,
		            None,
		            temp_lr,
		            None,
		            result_pipe[len(lowerCAmelCase_  ) - 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(lowerCAmelCase_  )  ):
				_a					:				Union[str, Any]				=							result_pipe[p][0].recv()
				process_array_[p].join()
		return arr



def 					__lowerCamelCase					(				)      ->				List[Any]:
		_a					:				Union[str, Any]				=							list(range(10						,      0						,      -1  )  )
		print('Initial List'  )
		print(*lowerCAmelCase_  )
		_a					:				List[str]				=							odd_even_transposition(lowerCAmelCase_  )
		print('Sorted List\n'  )
		print(*lowerCAmelCase_  )


if __name__ == "__main__":
							main()









'''simple docstring'''

# Function to print upper half of diamond (pyramid)



def 					__lowerCamelCase					(				lowerCAmelCase_  )      ->				int:
		for i in range(0						,      lowerCAmelCase_  ):
				for _ in range(0						,      n - i - 1  ):  # printing spaces
						print(' '						,      end=''  )
				for _ in range(0						,      i + 1  ):  # printing stars
						print('* '						,      end=''  )
				print()



def 					__lowerCamelCase					(				lowerCAmelCase_  )      ->				Union[str, Any]:
		for i in range(lowerCAmelCase_						,      0						,      -1  ):
				for _ in range(lowerCAmelCase_						,      0						,      -1  ):  # printing stars
						print('* '						,      end=''  )
				print()
				for _ in range(n - i + 1						,      0						,      -1  ):  # printing spaces
						print(' '						,      end=''  )



def 					__lowerCamelCase					(				lowerCAmelCase_  )      ->				Tuple:
		if n <= 0:
				print('       ...       ....        nothing printing :('  )
				return
		floyd(lowerCAmelCase_  )  # upper half
		reverse_floyd(lowerCAmelCase_  )  # lower half


if __name__ == "__main__":
							print(r'''| /\ | |- |  |-  |--| |\  /| |-''')
							print(r'''|/  \| |- |_ |_  |__| | \/ | |_''')
							__lowerCAmelCase						      =       1
							while K:
														__lowerCAmelCase						      =       int(input('''enter the number and , and see the magic : '''))
														print()
														pretty_print(user_number)
														__lowerCAmelCase						      =       int(input('''press 0 to exit... and 1 to continue...'''))

							print('''Good Bye...''')




