Enter two positive integers. The Euclidean algorithm will be used to find their greatest common divisor.
GCD(   ,     ) = ...