Fibonacci Series is defined by the recurrence
F(n) = F(n-1) + F(n-2),
where F(n) is the Nth term of Fibonacci Series and F(1) = F(2) = 1. Provided N you have to output the Nth Fibonacci Number mod 1000000007 (10^9 + 7).
Line 1 : N (1 <= N <= 10^15)
You have to return Nth Fibonacci number mod 1000000007 (10^9 + 7)
Login to submit your solution