We use the Euclidean algorithm to find the greatest common factor (GCF) of 68 and 102.