The Fibonacci numbers fn are defined for each natural number n as follows:
f0=f1=1 and for n greater than or equal to 2, by recurrence: fn=fn−1+fn−2
Let S=f1+f2+...+f2004+f2005. Calculate the largest value of N, such that the Fibonacci number fN satisfies fN<S fibonacci numbernumber theory