import java.util.Scanner;

/*
  Author:  James Tam
  Version: 2015

  Learning objective: tracing a recursive implementation of the Fibonacci
  sequence.
*/

public class DriverFib
{
    public static void main (String [] args)
    {
	Scanner in = null;
	int num = 0;
	Fibonacci aFib = new Fibonacci();

	in = new Scanner (System.in);
	System.out.print("Fibonacci value: ");
	num = in.nextInt();
	for (int i = 0; i <= num; i++)
	    System.out.println(i + ": " + aFib.calculate(i));	
    }
}