



lowerCamelCase__			= [
    [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],
]

def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			Any				,     _SCREAMING_SNAKE_CASE       :			List[str]				,     _SCREAMING_SNAKE_CASE       :			Union[str, Any]				,     _SCREAMING_SNAKE_CASE       :			Tuple    ):
				"""simple docstring"""







				__a       =		[False] * len(_SCREAMING_SNAKE_CASE    )
				__a       =		[s]
				__a       =		True

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

				return visited[t]

def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			int				,     _SCREAMING_SNAKE_CASE       :			str				,     _SCREAMING_SNAKE_CASE       :			str    ):
				"""simple docstring"""







				__a       =		[-1] * (len(_SCREAMING_SNAKE_CASE    ))
				__a       =		0
				__a       =		[]
				__a       =		[i[:] for i in graph]  # Record original cut, copy.
				while bfs(_SCREAMING_SNAKE_CASE				,     _SCREAMING_SNAKE_CASE				,     _SCREAMING_SNAKE_CASE				,     _SCREAMING_SNAKE_CASE    ):
								__a       =		float("""Inf"""    )
								__a       =		sink

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

								max_flow += path_flow
								__a       =		sink

								while v != source:
												__a       =		parent[v]
												graph[u][v] -= path_flow
												graph[v][u] += path_flow
												__a       =		parent[v]

				for i in range(len(_SCREAMING_SNAKE_CASE    )    ):
								for j in range(len(graph[0]    )    ):
												if graph[i][j] == 0 and temp[i][j] > 0:
																res.append((i, j)    )

				return res


if __name__ == "__main__":
						print(mincut(test_graph, source=0, sink=5))





from math import sqrt

def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			int    ):
				"""simple docstring"""







				if 1 < number < 4:
								# 2 and 3 are primes
								return True
				elif number < 2 or number % 2 == 0 or number % 3 == 0:
								# Negatives, 0, 1, all even numbers, all multiples of 3 are not primes
								return False

				# All primes number are in format of 6k +/- 1
				for i in range(5				,     int(sqrt(_SCREAMING_SNAKE_CASE    ) + 1    )				,     6    ):
								if number % i == 0 or number % (i + 2) == 0:
												return False
				return True

def   lowerCAmelCase__						(							_SCREAMING_SNAKE_CASE       :			int = 1_0001    ):
				"""simple docstring"""







				__a       =		0
				__a       =		1
				while count != nth and number < 3:
								number += 1
								if is_prime(_SCREAMING_SNAKE_CASE    ):
												count += 1
				while count != nth:
								number += 2
								if is_prime(_SCREAMING_SNAKE_CASE    ):
												count += 1
				return number


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