# Function to print upper half of diamond (pyramid)







def      _a					(   lowercase__	:      Tuple			):







     '''simple docstring'''


     for i in range(0  ,	lowercase__			):
          for _ in range(0  ,	n - i - 1			):  # printing spaces
               print(' '  ,	end=''			)
          for _ in range(0  ,	i + 1			):  # printing stars
               print('* '  ,	end=''			)
          print()







def      _a					(   lowercase__	:      List[str]			):







     '''simple docstring'''


     for i in range(lowercase__  ,	0  ,	-1			):
          for _ in range(lowercase__  ,	0  ,	-1			):  # printing stars
               print('* '  ,	end=''			)
          print()
          for _ in range(n - i + 1  ,	0  ,	-1			):  # printing spaces
               print(' '  ,	end=''			)







def      _a					(   lowercase__	:      int			):







     '''simple docstring'''


     if n <= 0:
          print('       ...       ....        nothing printing :('			)
          return
     floyd(lowercase__			)  # upper half
     reverse_floyd(lowercase__			)  # lower half


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

      print("Good Bye...")






from __future__ import annotations





def a(lowercase__      ,			lowercase__      ,			lowercase__      ,			lowercase__						):





	'''simple docstring'''
	if (direction == 1 and array[indexa] > array[indexa]) or (
	    direction == 0 and array[indexa] < array[indexa]
	):
		snake_case_		,							snake_case_   		=			array[indexa], array[indexa]





def a(lowercase__      ,			lowercase__      ,			lowercase__      ,			lowercase__						):





	'''simple docstring'''
	if length > 1:
		snake_case_   		=			int(length / 2						)
		for i in range(lowercase__      ,			low + middle						):
			comp_and_swap(lowercase__      ,			lowercase__      ,			i + middle      ,			lowercase__						)
		bitonic_merge(lowercase__      ,			lowercase__      ,			lowercase__      ,			lowercase__						)
		bitonic_merge(lowercase__      ,			low + middle      ,			lowercase__      ,			lowercase__						)





def a(lowercase__      ,			lowercase__      ,			lowercase__      ,			lowercase__						):





	'''simple docstring'''
	if length > 1:
		snake_case_   		=			int(length / 2						)
		bitonic_sort(lowercase__      ,			lowercase__      ,			lowercase__      ,			1						)
		bitonic_sort(lowercase__      ,			low + middle      ,			lowercase__      ,			0						)
		bitonic_merge(lowercase__      ,			lowercase__      ,			lowercase__      ,			lowercase__						)


if __name__ == "__main__":
		A									=  input('Enter numbers separated by a comma:\n').strip()
		A									=  [int(item.strip()) for item in user_input.split(',')]

		bitonic_sort(unsorted, 0, len(unsorted), 1)
		print('\nSorted array in ascending order is: ', end='')
		print(*unsorted, sep=', ')

		bitonic_merge(unsorted, 0, len(unsorted), 0)
		print('Sorted array in descending order is: ', end='')
		print(*unsorted, sep=', ')
