Depending on what you consider the length of 0 to be, there are either 6 or 7 one-digit Fibonacci numbers. There are 5 two-digit Fibonacci numbers. There are 4 four-digit Fibonacci numbers.

Prove that for n > 1, there are always either 4 or 5 n-digit Fibonacci numbers, or find a counterexample.