*Problem #3*

Recall that the Fibonacci numbers are defined recursively by
*F*_{1} = 1, *F*_{2} = 1, and
*F*_{n+1} =
*F*_{n} + *F*_{n-1}
for *n* ≥ 2.
What is the smallest (positive) integer *n*
such that the decimal representation of
*F*_{n} ends in four zeroes?
**
Source: The Bernoulli Trials
**