2.3(recursion Fibonacci)

//https://vk.com/evgenykravchenko0

                ___                                        ___                   ___
               /  /\                  ___                 /  /\                 /  /\
              /  /:/_                /__/\               /  /:/_               /  /:/_
             /  /:/ /\               \  \:\             /  /:/ /\             /  /:/ /\
            /  /:/ /:/_               \  \:\           /  /:/_/::\           /  /:/ /:/_
           /__/:/ /:/ /\          ___  \__\:\         /__/:/__\/\:\         /__/:/ /:/ /\
           \  \:\/:/ /:/         /__/\ |  |:|         \  \:\ /~~/:/         \  \:\/:/ /:/
            \  \::/ /:/          \  \:\|  |:|          \  \:\  /:/           \  \::/ /:/
             \  \:\/:/            \  \:\__|:|           \  \:\/:/             \  \:\/:/
              \  \::/              \__\::::/             \  \::/               \  \::/
               \__\/                   ~~~~               \__\/                 \__\/
                            ___
                           /__/\                ___                 ___
                           \  \:\              /  /\               /  /\
                            \  \:\            /  /:/              /  /:/
                        _____\__\:\          /__/::\             /__/::\
                       /__/::::::::\         \__\/\:\__          \__\/\:\__
                       \  \:\~~\~~\/            \  \:\/\            \  \:\/\
                        \  \:\  ~~~              \__\::/             \__\::/
                         \  \:\                  /__/:/              /__/:/
                          \  \:\                 \__\/               \__\/
                           \__\/
#include <stdio.h>

int Fibonacchi(int N)
{
  if (N == 0)
    return 0;
  else if (N == 1 || N == 2)
         return 1;
       else
         return Fibonacchi(N-2) + Fibonacchi(N-1);
}

int main()
{
  int N = 0;

  printf("Введите N : ");
  scanf("%d", &N);
  printf(" %d \n ", Fibonacchi(N));

  return 0;
}