/* Peter Cline, July 30
   Finding the nth fibonacci number
*/

#include <stdio.h>

int fibo(int n);

int main() {
  int a = 33;

  //printf("Enter an integer: ");
  //scanf("%d", &a);
  printf("Fibo(%d) is: %d\n", a, fibo(a));
  
  return 0;
}

int fibo(int n) {
  // base cases:
  if (n == 1 || n == 0)
    return n;

  // recurse on complex cases
  return fibo(n - 1) + fibo(n - 2);
}