"Garlic Guest Series" Challenge 4: Simple Fibonacci _ Count Garlic

Source of the topic: garlic

The Fibonacci sequence is a very interesting sequence, starting with 0 and 1, after which the Fibonacci coefficients are added by the previous two numbers. Ponachi The definition of Fibonacci sequence by mathematical formula can be regarded as the following form: f0=0
F1=1
Fn=fn-1+fn-2
We agreed that FN would represent the nth item in the Fibonacci sequence, and you know any of the Fibonacci sequences.
The input includes one row, including a number N (0≤N≤50).
The output includes a row, including a number, which is the value of the nth item in the Fibonacci sequence.
Sample 1
Input:
7
Output:

13

#include <stdio.h>
int Fibonacci (int n)
{
	if (n==0) return
		0;
	else if (n==1) return
		1;
	else return
		Fibonacci (n-1) +fibonacci (n-2);
}
int main ()
{
	int n,r;
	scanf ("%d", &n);
	r = Fibonacci (n);
	printf ("%d", r);
}