/******************************************************************************
 * This program computes Fibonacci Numbers using recursion.
 * 
 * Copyright © 2021 Richard Lesh.  All rights reserved.
 *****************************************************************************/

import org.pureprogrammer.Utils;

public class Fibonacci1 {

    static long fibonacci(int n) {
        if (n < 2) {
            return 1;
        }
        return fibonacci(n - 1) + fibonacci(n - 2);
    }

    public static void main(String[] args) {
        System.out.println("Fibonacci Sequence");
        for (int n = 1; n <= 20; ++n) {
            System.out.println(Utils.format("{0:d}: {1:d}", n, fibonacci(n)));
        }
    }
}