

def      _lowerCAmelCase(	__A   ,       __A			):
  return abs(__A			) if a == 0 else greatest_common_divisor(b % a   ,       __A			)
def      _lowerCAmelCase(	__A   ,       __A			):
  while y:  # --> when y=0 then loop will terminate and return x as final GCD.
    UpperCAmelCase      ,	UpperCAmelCase					      =  y, x % y
  return abs(__A			)
def      _lowerCAmelCase(	):
  try:
    UpperCAmelCase					      =  input("Enter two integers separated by comma (,): "			).split(","			)
    UpperCAmelCase					      =  int(nums[0]			)
    UpperCAmelCase					      =  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()






def      _lowerCAmelCase(	__A			):

  if not isinstance(__A   ,       __A			):
    raise TypeError("only integers accepted as input"			)
  else:
    UpperCAmelCase					      =  str(abs(__A			)			)
    UpperCAmelCase					      =  [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()



