





def 				__lowerCAmelCase(       _SCREAMING_SNAKE_CASE				)							-> list:




    """simple docstring"""




    def merge(_SCREAMING_SNAKE_CASE							,     _SCREAMING_SNAKE_CASE				) -> list:

        def _merge():
            while left and right:
                yield (left if left[0] <= right[0] else right).pop(0				)
            yield from left
            yield from right

        return list(_merge()				)

    if len(_SCREAMING_SNAKE_CASE				) <= 1:
        return collection
    _A     =							len(_SCREAMING_SNAKE_CASE				) // 2
    return merge(merge_sort(collection[:mid]				)							,     merge_sort(collection[mid:]				)				)


if __name__ == "__main__":
 import doctest

 doctest.testmod()
 __A							:			Tuple         =			input("Enter numbers separated by a comma:\n").strip()
 __A							:			Tuple         =			[int(item) for item in user_input.split(",")]
 print(*merge_sort(unsorted), sep=",")












from collections import defaultdict
from math import ceil, sqrt





def 				__lowerCAmelCase(       _SCREAMING_SNAKE_CASE = 1_000_000							,     _SCREAMING_SNAKE_CASE = 10				)							-> int:




    """simple docstring"""




    _A     =							defaultdict(_SCREAMING_SNAKE_CASE				)

    for outer_width in range(3							,     (t_limit // 4) + 2				):
        if outer_width * outer_width > t_limit:
            _A     =							max(
                ceil(sqrt(outer_width * outer_width - t_limit				)				)							,     1				)
        else:
            _A     =							1

        hole_width_lower_bound += (outer_width - hole_width_lower_bound) % 2

        for hole_width in range(_SCREAMING_SNAKE_CASE							,     outer_width - 1							,     2				):
            count[outer_width * outer_width - hole_width * hole_width] += 1

    return sum(1 for n in count.values() if 1 <= n <= 10				)


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





