Compute the greatest common divisor of 84 and 30 using Euclid's algorithm (`gcd(a, b) = gcd(b, a mod b)` with `gcd(a, 0) = a`). Print the result. You may not import `math.gcd`.