/* Compute the nth Fibonacci number using recursion */
long
fibiter(a,b,c)
long a,b,c;
{
        if (c <= 0L) return b;
        else return fibiter(a+b,a,c - 1);
}


void
fib(n)
long * n;
{
        *n = fibiter(1,0,*n) ;
}