
"""simple docstring"""

from __future__ import annotations

from typing import Any
def 		UpperCAmelCase (		a_      ):





		'''simple docstring'''


		if not postfix_notation:
				return 0

		lowerCamelCase					:      Dict          =   {"+", "-", "*", "/"}
		lowerCamelCase					:      list[Any]          =   []

		for token in postfix_notation:
				if token in operations:
						lowerCamelCase					:      List[str]          =   stack.pop(), stack.pop()
						if token == "+":
								stack.append(a + b      )
						elif token == "-":
								stack.append(a - b      )
						elif token == "*":
								stack.append(a * b      )
						else:
								if a * b < 0 and a % b != 0:
										stack.append(a // b + 1      )
								else:
										stack.append(a // b      )
				else:
						stack.append(int(_lowercase      )      )

		return stack.pop()


if __name__ == "__main__":
					import doctest

					doctest.testmod()








"""simple docstring"""

def 		UpperCAmelCase (		a_,						a_      ):





		'''simple docstring'''


		while b:
				lowerCamelCase     ,   lowerCamelCase					:      Tuple          =   b, a % b
		return a
def 		UpperCAmelCase (		a_,						a_      ):





		'''simple docstring'''


		return a if b == 0 else euclidean_gcd_recursive(a_,						a % b      )
def 		UpperCAmelCase (		):





		'''simple docstring'''


		print(F"""euclidean_gcd(3, 5) = {euclidean_gcd(3,						5      )}"""      )
		print(F"""euclidean_gcd(5, 3) = {euclidean_gcd(5,						3      )}"""      )
		print(F"""euclidean_gcd(1, 3) = {euclidean_gcd(1,						3      )}"""      )
		print(F"""euclidean_gcd(3, 6) = {euclidean_gcd(3,						6      )}"""      )
		print(F"""euclidean_gcd(6, 3) = {euclidean_gcd(6,						3      )}"""      )

		print(F"""euclidean_gcd_recursive(3, 5) = {euclidean_gcd_recursive(3,						5      )}"""      )
		print(F"""euclidean_gcd_recursive(5, 3) = {euclidean_gcd_recursive(5,						3      )}"""      )
		print(F"""euclidean_gcd_recursive(1, 3) = {euclidean_gcd_recursive(1,						3      )}"""      )
		print(F"""euclidean_gcd_recursive(3, 6) = {euclidean_gcd_recursive(3,						6      )}"""      )
		print(F"""euclidean_gcd_recursive(6, 3) = {euclidean_gcd_recursive(6,						3      )}"""      )


if __name__ == "__main__":
					main()






