'''simple docstring'''

from math import isqrt







def      UpperCamelCase_						(					snake_case_       :       str      )					->     bool:






 '''simple docstring'''

 return all(number % divisor != 0 for divisor in range(2						,		isqrt(lowercase__      ) + 1      )      )







def      UpperCamelCase_						(					snake_case_       :       Union[str, Any] = 10**6      )					->     int:






 '''simple docstring'''

 __lowerCAmelCase											=						0
 __lowerCAmelCase											=						1
 __lowerCAmelCase											=						7
 while prime_candidate < max_prime:
  primes_count += is_prime(lowercase__      )

  cube_index += 1
  prime_candidate += 6 * cube_index

 return primes_count


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










def        _lowerCamelCase(	lowercase__   , lowercase__   , lowercase__   , lowercase__	)						->	Union[str, Any]:

		'''simple docstring'''







		__lowercase=			[False] * len(lowercase__	)
		__lowercase=			[]
		queue.append(lowercase__	)
		__lowercase=			True

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

		return visited[t]







def        _lowerCamelCase(	lowercase__   , lowercase__   , lowercase__	)						->	int:

		'''simple docstring'''







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

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

				max_flow += path_flow
				__lowercase=			sink

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


lowerCAmelCase           =		[
    [0, 1_6, 1_3, 0, 0, 0],
    [0, 0, 1_0, 1_2, 0, 0],
    [0, 4, 0, 0, 1_4, 0],
    [0, 0, 9, 0, 0, 2_0],
    [0, 0, 0, 7, 0, 4],
    [0, 0, 0, 0, 0, 0],
]

lowerCAmelCase       ,lowerCAmelCase           =		0, 5
print(ford_fulkerson(graph, source, sink))






