Euclidean algorithm (Z)/Gcd/2956 and 2444/Exercise

Determine in , using the Euclidean algorithm, the greatest common divisor of and .