useing recursion function fibonaki series

  #include <stdio.h>

int fib(int number){

 if (number == 1 || number == 2){

return number-1;

     }

 else{

return (fib(number - 1) + fib(number - 2));

 }

}

int main(void)

{

int number;

    scanf("%d", &number);

printf("Enter the number \n");

printf("the fibonaki number of %d is %d\n", number, fib(number));

return 0;

}