fibonacci series with recursion in c++

#include<iostream>
#include<conio.h>
using namespace std;
int fabn(int n)
{
if(n==0)
return 0;
if(n==1)
return 1;
else

return (fabn(n-2)+fabn(n-1));  


}
int main()
{
cout << fabn(7);
getch();
   
   
}