//FibonacciRecursive.java

public class FibonacciRecursive
{
    public static void main(String[] args)
    {
        long n = Long.parseLong(args[0]);
        long i;
        for (i = 1; i <= n; i++)
        {
            System.out.printf("%19d", fibRecursive(i));
            if (i % 4 == 0)
            {
                System.out.println();
            }
        }
        if ((i - 1) % 4 != 0)
        {
            System.out.println();
        }
    }

    //Computes and returns the nth Fibonacci number,
    //using a recursive algorithm
    private static long fibRecursive(long n)
    {
        if (n <= 2)
        {
            return 1;
        }
        else
        {
            return fibRecursive(n - 2) + fibRecursive(n - 1);
        }
    }
}