






"""simple docstring"""


from __future__ import annotations


def        UpperCAmelCase      (					a__ ):





						'''simple docstring'''






						if len(a__ ) == 0:
												return []
						lowerCAmelCase	, lowerCAmelCase   :int						=			min(a__ ), max(a__ )
						lowerCAmelCase   :Any						=			int(max_value - min_value ) + 1
						lowerCAmelCase   :list[list]						=			[[] for _ in range(a__ )]

						for i in my_list:
												buckets[int(i - min_value )].append(a__ )

						return [v for bucket in buckets for v in sorted(a__ )]


if __name__ == "__main__":
		from doctest import testmod

		testmod()
		assert bucket_sort([4, 5, 3, 2, 1]) == [1, 2, 3, 4, 5]
		assert bucket_sort([0, 1, -10, 15, 2, -2]) == [-10, -2, 0, 1, 2, 15]







"""simple docstring"""


from math import sqrt


def        UpperCAmelCase      (					a__ = 1_00_00_00 ):





						'''simple docstring'''






						lowerCAmelCase   :int						=			0
						lowerCAmelCase   :int						=			0
						lowerCAmelCase   :int

						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(a__     ,      sum_shortest_sides // 2 )
																								    - max(1     ,      sum_shortest_sides - max_cuboid_size )
																								    + 1
																								)

						return max_cuboid_size


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