code: def igcd(a, b):
          
          a = int(round(a))
          b = int(round(b))
          if b < 0:
              b = -b
          while b:
              a, b = b, a % b
          if a == 1 or b == 1:
              return 1
          return a
docs: :param a: First integer
          :param b: Second integer
          :return: the integer GCD between a and b