#include<stdio.h>
#include<conio.h>
long fibonacci (long);
void main()
{
long result, number;
printf("Enter an interger :");
scanf("%d",&number);
result = fibonacci (number);
printf("Fibonacci %d number = %d",number,result);
getch();
}
// recursive function starts
long fibonacci(long n)
{
if (n == 0 || n == 1 ) // base case
return n;
else
return fibonacci(n-1) + fibonacci(n-2);
}