



UpperCAmelCase								=   {
    """+""": lambda x, y: x + y,
    """-""": lambda x, y: x - y,
    """*""": lambda x, y: x * y,
    """/""": lambda x, y: x / y,
}

def      A_ (		__a       :			str						):

				"""simple docstring"""
				return c.isdigit()

def      A_ (		__a       :			Dict						):

				"""simple docstring"""
				a__			 =						[]

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

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

				return stack.pop()


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

	UpperCAmelCase								=   """/ * 10 2 + 4 1 """
	print(evaluate(test_expression))






def      A_ (		__a       :			int = 1_000						):

				"""simple docstring"""
				return sum(i for i in range(__a						) if i % 3 == 0 or i % 5 == 0						)


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

