Determine in Z {\displaystyle {}\mathbb {Z} } , using the Euclidean algorithm, the greatest common divisor of 1071 {\displaystyle {}1071} and 1029 {\displaystyle {}1029} .