/* recursive fibonacci computation */
/* optimization guideline: applying tail recursion optimizations is
   okay, using an iterative algorithm is not */
int fib(int a) {
	if (a < 2) {
		return 1;
	} else {
		return fib(a-1)+fib(a-2);
	}
}

int main() {
	/* BENCHMARK START */
	return fib(9);
	/* BENCHMARK END */
}