






from __future__ import annotations





def  _lowerCamelCase						(						__lowerCamelCase ,							__lowerCamelCase ,							__lowerCamelCase ,							__lowerCamelCase       ) ->			None:

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





def  _lowerCamelCase						(						__lowerCamelCase ,							__lowerCamelCase ,							__lowerCamelCase ,							__lowerCamelCase       ) ->			None:

     '''simple docstring'''
     if length > 1:
          UpperCAmelCase__      :  Optional[int]				      =			int(length / 2       )
          for i in range(__lowerCamelCase ,							low + middle       ):
               comp_and_swap(__lowerCamelCase ,							__lowerCamelCase ,							i + middle ,							__lowerCamelCase       )
          bitonic_merge(__lowerCamelCase ,							__lowerCamelCase ,							__lowerCamelCase ,							__lowerCamelCase       )
          bitonic_merge(__lowerCamelCase ,							low + middle ,							__lowerCamelCase ,							__lowerCamelCase       )





def  _lowerCamelCase						(						__lowerCamelCase ,							__lowerCamelCase ,							__lowerCamelCase ,							__lowerCamelCase       ) ->			None:

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


if __name__ == "__main__":
      SCREAMING_SNAKE_CASE__		:							Dict 				=				input("""Enter numbers separated by a comma:\n""").strip()
      SCREAMING_SNAKE_CASE__		:							Dict 				=				[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=""", """)











"""simple docstring"""






from math import sqrt




def 			snake_case		(		lowerCAmelCase_ = 1000000	)						->				int:
  _snake_case   	=      0
  _snake_case   	=      0
  _snake_case   	=      42

  while num_cuboids <= limit:
    max_cuboid_size += 1
    for sum_shortest_sides in range(2  ,						2 * max_cuboid_size + 1	):
      if sqrt(sum_shortest_sides**2 + max_cuboid_size**2	).is_integer():
        num_cuboids += (
            min(lowerCAmelCase_  ,						sum_shortest_sides // 2	)
            - max(1  ,						sum_shortest_sides - max_cuboid_size	)
            + 1
        )

  return max_cuboid_size


if __name__ == "__main__":
     print(F"{solution() = }")





