






"""simple docstring"""
def 				lowercase__		(					lowerCamelCase,						lowerCamelCase       ):
				return abs(lowerCamelCase       ) if a == 0 else greatest_common_divisor(b % a,						lowerCamelCase       )





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





def 				lowercase__		(					):
				try:
								_SCREAMING_SNAKE_CASE   :		Union[str, Any]       		=    input('Enter two integers separated by comma (,): '       ).split(','       )
								_SCREAMING_SNAKE_CASE   :		Dict       		=    int(nums[0]       )
								_SCREAMING_SNAKE_CASE   :		Dict       		=    int(nums[1]       )
								print(
								    f"""greatest_common_divisor({num_a}, {num_a}) = """
								    f"""{greatest_common_divisor(lowerCamelCase,						lowerCamelCase       )}"""       )
								print(f"""By iterative gcd({num_a}, {num_a}) = {gcd_by_iterative(lowerCamelCase,						lowerCamelCase       )}"""       )
				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))

