Step 1 :
Divide $ 1256 $ by $ 140 $ and get the remainder

$$ 1256 : 140 = 8 \text{ ( remainder is } \color{blue}{ 136 } \text{ ) } $$

The remainder is positive ($ 136 > 0 $), so we will continue with division.

Step 2 :
Divide $ 140 $ by $ \color{blue}{ 136 } $ and get the remainder

$$ 140 : 136 = 1 \text{ ( remainder is } \color{blue}{ 4 } \text{ ) } $$

The remainder is still positive ($ 4 > 0 $), so we will continue with division.

Step 3 :
Divide $ 136 $ by $ \color{blue}{ 4 } $ and get the remainder

$$ 136 : \color{blue}{ \boxed { 4 }} = 34 \text{ ( remainder is } \color{blue}{ 0 } \text{ ) } $$

The remainder is zero => GCD is the last divisor $ \color{blue}{ \boxed { 4 }} $.

This solution can be visualized using a Venn diagram.

The GCD equals the product of the numbers at the intersection.

GCD Calculator