Euclidean algorithm (Z)/Gcd/1071 and 1029/Exercise

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