


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



def   snake_case						(				_a:     list							)->		list:
      '''simple docstring'''


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


if __name__ == "__main__":
   import doctest

   doctest.testmod()

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







"""simple docstring"""


def   snake_case						(				_a:     List[Any]		,   _a:     Any		,   _a:     str		,   _a:     List[Any]							)->		List[Any]:
      '''simple docstring'''


      lowerCamelCase__           =		[False] * len(_a							)
      lowerCamelCase__           =		[]
      queue.append(_a							)
      lowerCamelCase__           =		True

      while queue:
            lowerCamelCase__           =		queue.pop(0							)
            for ind in range(len(graph[u]							)							):
                  if visited[ind] is False and graph[u][ind] > 0:
                        queue.append(_a							)
                        lowerCamelCase__           =		True
                        lowerCamelCase__           =		u

      return visited[t]



def   snake_case						(				_a:     List[Any]		,   _a:     str		,   _a:     List[str]							)->		Optional[int]:
      '''simple docstring'''


      lowerCamelCase__           =		[-1] * (len(_a							))
      lowerCamelCase__           =		0
      while bfs(_a		,   _a		,   _a		,   _a							):
            lowerCamelCase__           =		float('Inf'							)
            lowerCamelCase__           =		sink

            while s != source:
                  # Find the minimum value in select path
                  lowerCamelCase__           =		min(_a		,   graph[parent[s]][s]							)
                  lowerCamelCase__           =		parent[s]

            max_flow += path_flow
            lowerCamelCase__           =		sink

            while v != source:
                  lowerCamelCase__           =		parent[v]
                  graph[u][v] -= path_flow
                  graph[v][u] += path_flow
                  lowerCamelCase__           =		parent[v]
      return max_flow


_snake_case          =							[
    [0, 16, 13, 0, 0, 0],
    [0, 0, 10, 12, 0, 0],
    [0, 4, 0, 0, 14, 0],
    [0, 0, 9, 0, 0, 20],
    [0, 0, 0, 7, 0, 4],
    [0, 0, 0, 0, 0, 0],
]

_snake_case      ,					_snake_case          =							0, 5






print(ford_fulkerson(graph, source, sink))



