


from math import ceil, sqrt






def 							__lowercase       (			__lowerCAmelCase							:    int = 1_0_0_0_0_0_0       ):
							a__					=					0

							for outer_width in range(3 ,   (limit // 4) + 2       ):
														if outer_width**2 > limit:
																					a__					=					max(ceil(sqrt(outer_width**2 - limit       )       ) ,   1       )
														else:
																					a__					=					1
														if (outer_width - hole_width_lower_bound) % 2:
																					hole_width_lower_bound += 1

														answer += (outer_width - hole_width_lower_bound - 2) // 2 + 1

							return answer


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








from __future__ import annotations






def 							__lowercase       (			__lowerCAmelCase							:    list[int] ,   __lowerCAmelCase							:    int ,   __lowerCAmelCase							:    int ,   __lowerCAmelCase							:    int       ):
							if (direction == 1 and array[indexa] > array[indexa]) or (
							    direction == 0 and array[indexa] < array[indexa]
							):
														a__				, a__					=					array[indexa], array[indexa]






def 							__lowercase       (			__lowerCAmelCase							:    list[int] ,   __lowerCAmelCase							:    int ,   __lowerCAmelCase							:    int ,   __lowerCAmelCase							:    int       ):
							if length > 1:
														a__					=					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 							__lowercase       (			__lowerCAmelCase							:    list[int] ,   __lowerCAmelCase							:    int ,   __lowerCAmelCase							:    int ,   __lowerCAmelCase							:    int       ):
							if length > 1:
														a__					=					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__":
						snake_case							:	int					      =				input('''Enter numbers separated by a comma:\n''').strip()
						snake_case							:	Optional[int]					      =				[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=''', ''')




