






__UpperCAmelCase     							=						0  # The first color of the flag.
__UpperCAmelCase     							=						1  # The second color of the flag.
__UpperCAmelCase     							=						2  # The third color of the flag.
__UpperCAmelCase     							=						(red, white, blue)




def 					lowercase__				(					__snake_case   :							list  ):


					'''simple docstring'''


					if not sequence:
										return []
					if len(__snake_case  ) == 1:
										return list(__snake_case  )
					UpperCAmelCase_   :				List[str]						=						0
					UpperCAmelCase_   :				str						=						len(__snake_case  ) - 1
					UpperCAmelCase_   :				Any						=						0
					while mid <= high:
										if sequence[mid] == colors[0]:
															UpperCAmelCase_	,  UpperCAmelCase_   :				List[str]						=						sequence[mid], sequence[low]
															low += 1
															mid += 1
										elif sequence[mid] == colors[1]:
															mid += 1
										elif sequence[mid] == colors[2]:
															UpperCAmelCase_	,  UpperCAmelCase_   :				List[Any]						=						sequence[high], sequence[mid]
															high -= 1
										else:
															UpperCAmelCase_   :				Union[str, Any]						=						F"The elements inside the sequence must contains only {colors} values"
															raise ValueError(__snake_case  )
					return sequence


if __name__ == "__main__":
		import doctest

		doctest.testmod()

		__UpperCAmelCase     							=						input('Enter numbers separated by commas:\n').strip()
		__UpperCAmelCase     							=						[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__				(					__snake_case   :							int = 1_000_000					,	__snake_case   :							int = 10  ):


					'''simple docstring'''


					UpperCAmelCase_   :				defaultdict						=						defaultdict(__snake_case  )

					for outer_width in range(3					,	(t_limit // 4) + 2  ):
										if outer_width * outer_width > t_limit:
															UpperCAmelCase_   :				Union[str, Any]						=						max(
															    ceil(sqrt(outer_width * outer_width - t_limit  )  )					,	1  )
										else:
															UpperCAmelCase_   :				int						=						1

										hole_width_lower_bound += (outer_width - hole_width_lower_bound) % 2

										for hole_width in range(__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() = }')






