





'''simple docstring'''






def   __A    (				a_    :	Any   ,a_    :	str						):
		return abs(a_						) if a == 0 else greatest_common_divisor(b % a   ,a_						)






def   __A    (				a_    :	Any   ,a_    :	Optional[Any]						):
		while y:  # --> when y=0 then loop will terminate and return x as final GCD.
				lowerCAmelCase  :     Optional[Any]       						= y, x % y
		return abs(a_						)






def   __A    (				):
		try:
				lowerCAmelCase  :     Union[str, Any]       						= input("Enter two integers separated by comma (,): "						).split(","						)
				lowerCAmelCase  :     Dict       						= int(nums[0]						)
				lowerCAmelCase  :     Dict       						= int(nums[1]						)
				print(
				    f'''greatest_common_divisor({num_a}, {num_a}) = '''
				    f'''{greatest_common_divisor(a_   ,a_						)}'''						)
				print(f'''By iterative gcd({num_a}, {num_a}) = {gcd_by_iterative(a_   ,a_						)}'''						)
		except (IndexError, UnboundLocalError, ValueError):
				print("Wrong input"						)


if __name__ == "__main__":
					main()











"""simple docstring"""
import operator as op





def 				lowercase__		(					lowerCamelCase       ):
				_SCREAMING_SNAKE_CASE   :		int       		=    []
				_SCREAMING_SNAKE_CASE   :		Dict       		=    lambda lowerCamelCase,						lowerCamelCase       : int(x / y       )  # noqa: E731 integer division operation
				_SCREAMING_SNAKE_CASE   :		Tuple       		=    {
				    '^': op.pow,
				    '*': op.mul,
				    '/': div,
				    '+': op.add,
				    '-': op.sub,
				}  # operators & their respective operation

				# print table header
				print('Symbol'.center(8       ),						'Action'.center(12       ),						'Stack',						sep=' | '       )
				print('-' * (30 + len(lowerCamelCase       ))       )

				for x in post_fix:
								if x.isdigit():  # if x in digit
												stack.append(lowerCamelCase       )  # append x to stack
												# output in tabular format
												print(x.rjust(8       ),						('push(' + x + ')').ljust(12       ),						','.join(lowerCamelCase       ),						sep=' | '       )
								else:
												_SCREAMING_SNAKE_CASE   :		int       		=    stack.pop()  # pop stack
												# output in tabular format
												print(''.rjust(8       ),						('pop(' + b + ')').ljust(12       ),						','.join(lowerCamelCase       ),						sep=' | '       )

												_SCREAMING_SNAKE_CASE   :		Tuple       		=    stack.pop()  # pop stack
												# output in tabular format
												print(''.rjust(8       ),						('pop(' + a + ')').ljust(12       ),						','.join(lowerCamelCase       ),						sep=' | '       )

												stack.append(
												    str(opr[x](int(lowerCamelCase       ),						int(lowerCamelCase       )       )       )       )  # evaluate the 2 values popped from stack & push result to stack
												# output in tabular format
												print(
												    x.rjust(8       ),						('push(' + a + x + b + ')').ljust(12       ),						','.join(lowerCamelCase       ),						sep=' | ',						)

				return int(stack[0]       )


if __name__ == "__main__":
			lowerCAmelCase__    						=			input('\n\nEnter a Postfix Equation (space separated) = ').split(' ')
			print('\n\tResult = ', solve(Postfix))

