/*
 * Simple example of recursion -- fibonacci sequence.
 * (Alas, *very* inefficient -- because of duplication of work.)
 */
#include <stdio.h>

int fib(int n);

int main(void) {
	int n;
	printf("enter integer value\n");
	if (scanf("%d", &n) == 1) {
		printf("fibonacci(%d) is %d\n", n, fib(n));
		return 0;
	}
	else {
		printf("not an integer value\n");
		return 1;
	}
}

int fib(int n) {
	if (n <= 1) 
		return 1;
	else 
		return fib(n-1) + fib(n-2);
}