When using the Euclidean algorithm to compute $\gcd(a, b)$, consecutive Fibonacci numbers require the most division steps. Which pair below will require the MOST divisions?