The Fibonacci sequence of the garlic guest

The Fibonacci sequence is a very interesting sequence, starting with 0 and 1, after which the Fibonacci Fibonacci coefficients are added by the previous two numbers. The Fibonacci sequence is defined by a mathematical formula as follows:

F0=0

F1=1

Fn=fn-1+fn-2

We agree that Fn represents the nth of the Fibonacci sequence, can you tell any of the Fibonacci sequences?

The input includes a row, including a number N (0≤N≤50).

The output includes a row, including a number, which is the value of the nth item of the Fibonacci sequence.

Sample Input7Sample Output -

The C + + implementation code is as follows:

#include <iostream> using namespace std; int f(int i); int main()
{ int N;
    cin>>N;
    cout<<f(N)<<endl; return 0;
} int f(int i)
{ if (i==0)
    { return 0;
    } else if (i==1)
    { return 1;
    } else { return f(i-1)+f(i-2);
    }
}

The Fibonacci sequence of the garlic guest