/*
 * Recursive calculation of Fibonacci numbers
 */

#include <stdio.h>

int fib(int n);

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

int main(void)
{
    for (int i = 1; i < 10; i++)
    {
        printf("%3d    %10d\n", i, fib(i));
    }
    return 0;
}