

"""simple docstring"""






lowerCamelCase__			:					Dict							  =					{
    '''+''': lambda x, y: x + y,
    '''-''': lambda x, y: x - y,
    '''*''': lambda x, y: x * y,
    '''/''': lambda x, y: x / y,
}
def  UpperCamelCase   (     _lowerCAmelCase       :  Union[str, Any]	)			->     Tuple:
	return c.isdigit()
def  UpperCamelCase   (     _lowerCAmelCase       :  List[Any]	)			->     Tuple:
	_UpperCAmelCase      :							Any       =   []

	# iterate over the string in reverse order
	for c in expression.split()[::-1]:
		# push operand to stack
		if is_operand(_lowerCAmelCase	):
			stack.append(int(_lowerCAmelCase	)	)

		else:
			# pop values from stack can calculate the result
			# push the result onto the stack again
			_UpperCAmelCase      :							Tuple       =   stack.pop()
			_UpperCAmelCase      :							str       =   stack.pop()
			stack.append(calc[c](_lowerCAmelCase,					_lowerCAmelCase	)	)

	return stack.pop()


# Driver code
if __name__ == "__main__":
						lowerCamelCase__			:					int							  =					'''+ 9 * 2 6'''
						print(evaluate(test_expression))

						lowerCamelCase__			:					Optional[int]							  =					'''/ * 10 2 + 4 1 '''
						print(evaluate(test_expression))








"""simple docstring"""






import math
def  UpperCamelCase   (     _lowerCAmelCase       :  int	)			->     bool:

	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(math.sqrt(_lowerCAmelCase	) + 1	),					6	):
		if number % i == 0 or number % (i + 2) == 0:
			return False
	return True
def  UpperCamelCase   (     _lowerCAmelCase       :  int = 2000000	)			->     int:
	return sum(num for num in range(3,					_lowerCAmelCase,					2	) if is_prime(_lowerCAmelCase	)	) + 2 if n > 2 else 0


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





