


snake_case							:	Any					      =				0  # The first color of the flag.
snake_case							:	Optional[int]					      =				1  # The second color of the flag.
snake_case							:	str					      =				2  # The third color of the flag.
snake_case							:	Optional[int]					      =				(red, white, blue)






def 							__lowercase       (			__lowerCAmelCase							:    list       ):
							if not sequence:
														return []
							if len(__lowerCAmelCase       ) == 1:
														return list(__lowerCAmelCase       )
							a__					=					0
							a__					=					len(__lowerCAmelCase       ) - 1
							a__					=					0
							while mid <= high:
														if sequence[mid] == colors[0]:
																					a__				, a__					=					sequence[mid], sequence[low]
																					low += 1
																					mid += 1
														elif sequence[mid] == colors[1]:
																					mid += 1
														elif sequence[mid] == colors[2]:
																					a__				, a__					=					sequence[high], sequence[mid]
																					high -= 1
														else:
																					a__					=					F'The elements inside the sequence must contains only {colors} values'
																					raise ValueError(__lowerCAmelCase       )
							return sequence


if __name__ == "__main__":
						import doctest

						doctest.testmod()

						snake_case							:	Union[str, Any]					      =				input('''Enter numbers separated by commas:\n''').strip()
						snake_case							:	str					      =				[int(item.strip()) for item in user_input.split(''',''')]
						print(f"""{dutch_national_flag_sort(unsorted)}""")





from collections import defaultdict
from math import ceil, sqrt






def 							__lowercase       (			__lowerCAmelCase							:    int = 1_0_0_0_0_0_0 ,   __lowerCAmelCase							:    int = 1_0       ):
							a__					=					defaultdict(__lowerCAmelCase       )

							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(__lowerCAmelCase ,   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 <= 1_0       )


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




