
from math import ceil, sqrt


def 						UpperCAmelCase			(	a_ = 1_0_0_0_0_0_0						)		->	Tuple:







				"""simple docstring"""



				__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() = }''')







def      _A       (		SCREAMING_SNAKE_CASE     :   Optional[Any]						):





  """simple docstring"""



  a__	:					Optional[Any]										=len(SCREAMING_SNAKE_CASE						)
  while cur > 1:
    # Find the maximum number in arr
    a__	:					List[Any]										=arr.index(max(arr[0:cur]						)						)
    # Reverse from 0 to mi
    a__	:					int										=arr[mi::-1] + arr[mi + 1 : len(SCREAMING_SNAKE_CASE						)]
    # Reverse whole list
    a__	:					List[str]										=arr[cur - 1 :: -1] + arr[cur : len(SCREAMING_SNAKE_CASE						)]
    cur -= 1
  return arr


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






