Induction · Hard problem

Strong induction proves every positive integer is a sum of non-consecutive Fibonacci numbers ($1, 2, 3, 5, 8, 13, \ldots$): subtract the largest Fibonacci number that fits and apply the hypothesis to the rest. How many terms does this give for $500$?