






"""simple docstring"""
def 			__UpperCamelCase	(		snake_case__ = 2_000_000					):
	A_		:						List[str]	    =   [0 for i in range(n + 1					)]
	A_		:						Dict	    =   1
	A_		:						Any	    =   1

	for i in range(2   ,   int(n**0.5					) + 1					):
		if primality_list[i] == 0:
			for j in range(i * i   ,   n + 1   ,   snake_case__					):
				A_		:						Any	    =   1
	A_		:						Tuple	    =   0
	for i in range(snake_case__					):
		if primality_list[i] == 0:
			sum_of_primes += i
	return sum_of_primes


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









"""simple docstring"""
def 			__UpperCamelCase	(		snake_case__   ,   snake_case__   ,   snake_case__					):
	return not any(
	    neighbour == 1 and colored_vertices[i] == color
	    for i, neighbour in enumerate(snake_case__					)					)






def 			__UpperCamelCase	(		snake_case__   ,   snake_case__   ,   snake_case__   ,   snake_case__					):

	# Base Case
	if index == len(snake_case__					):
		return True

	# Recursive Step
	for i in range(snake_case__					):
		if valid_coloring(graph[index]   ,   snake_case__   ,   snake_case__					):
			# Color current vertex
			A_		:						Dict	    =   i
			# Validate coloring
			if util_color(snake_case__   ,   snake_case__   ,   snake_case__   ,   index + 1					):
				return True
			# Backtrack
			A_		:						Union[str, Any]	    =   -1
	return False






def 			__UpperCamelCase	(		snake_case__   ,   snake_case__					):
	A_		:						int	    =   [-1] * len(snake_case__					)

	if util_color(snake_case__   ,   snake_case__   ,   snake_case__   ,   0					):
		return colored_vertices

	return []

