from math import ceil, sqrt



def lowerCamelCase  (   SCREAMING_SNAKE_CASE = 1_000_000	):
    '''simple docstring'''







    __UpperCamelCase     :Union[str, Any]			  =		0

    for outer_width in range(3  ,			(limit // 4) + 2	):
        if outer_width**2 > limit:
            __UpperCamelCase     :Any			  =		max(ceil(sqrt(outer_width**2 - limit	)	)  ,			1	)
        else:
            __UpperCamelCase     :Union[str, Any]			  =		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 						UpperCAmelCase			(	a_						)		->	list:







				"""simple docstring"""



				if len(a_						) <= 1:
								return lst

				__A   			= 1

				while i < len(a_						):
								if lst[i - 1] <= lst[i]:
												i += 1
								else:
												__A			,							__A   			= lst[i], lst[i - 1]
												i -= 1
												if i == 0:
																__A   			= 1

				return lst


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