





'''simple docstring'''






def      __A						(							a_						:  int	):

		if not isinstance(a_      ,a_	):
				raise TypeError("only integers accepted as input"	)
		else:
				lowerCAmelCase     :    Union[str, Any]						=   str(abs(a_	)	)
				lowerCAmelCase     :    int						=   [list(a_	) for char in range(len(a_	)	)]
				for index in range(len(a_	)	):
						num_transpositions[index].pop(a_	)
				return max(
				    int("".join(list(a_	)	)	) for transposition in num_transpositions	)


if __name__ == "__main__":
					__import__("""doctest""").testmod()










'''simple docstring'''






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






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






def      __A						(							):
		try:
				lowerCAmelCase     :    Tuple						=   input("Enter two integers separated by comma (,): "	).split(","	)
				lowerCAmelCase     :    Tuple						=   int(nums[0]	)
				lowerCAmelCase     :    Tuple						=   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()



