InterviewBit Academy is now Scaler!
InterviewBit Academy is now Scaler Academy!

Find Nth Fibonacci


Problem Description

Given an integer A you need to find the Ath fibonacci number modulo 109 + 7.

The first fibonacci number F1 = 1

The first fibonacci number F2 = 1

The nth fibonacci number Fn = Fn-1 + Fn-2 (n > 2)



Problem Constraints

1 <= A <= 109.



Input Format

First argument is an integer A.



Output Format

Return a single integer denoting Ath fibonacci number modulo 109 + 7.



Example Input

Input 1:

 A = 4

Input 2:

 A = 3



Example Output

Output 1:

 3

Output 2:

 2



Example Explanation

Explanation 1:

 F3 = F2 + F1 = 1 + 1 = 2
 F4 = F3 + F2 = 2 + 1 = 3

Explanation 2:

 F3 = F2 + F1 = 1 + 1 = 2



NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.
Start solving Find Nth Fibonacci on Interview Code Editor
Sign Up
to access hints and editorial solutions for Find Nth Fibonacci
Asked In:

Discussion


Loading...
Click here to start solving coding interview questions