
"""simple docstring"""


__A					=			{
    '+': lambda x, y: x + y,
    '-': lambda x, y: x - y,
    '*': lambda x, y: x * y,
    '/': lambda x, y: x / y,
}



def        _lowerCamelCase(__UpperCamelCase			)							->					Dict:
	return c.isdigit()



def        _lowerCamelCase(__UpperCamelCase			)							->					Tuple:
	_lowerCAmelCase								=[]

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

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

	return stack.pop()


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

			__A					=			'/ * 10 2 + 4 1 '
			print(evaluate(test_expression))





"""simple docstring"""


def        _lowerCamelCase(__UpperCamelCase = 20			)							->					int:

	try:
		_lowerCAmelCase								=int(__UpperCamelCase			)
	except (TypeError, ValueError):
		raise TypeError("""Parameter n must be int or castable to int."""			)
	if n <= 0:
		raise ValueError("""Parameter n must be greater than or equal to one."""			)
	_lowerCAmelCase								=0
	while 1:
		i += n * (n - 1)
		_lowerCAmelCase								=0
		for j in range(2       ,					__UpperCamelCase			):
			if i % j != 0:
				_lowerCAmelCase								=1
				break
		if nfound == 0:
			if i == 0:
				_lowerCAmelCase								=1
			return i
	return None


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



