import java.util.Scanner;

public class Fibonacci_Recursive
{
	public static int calcFibonacci(int index)
	{
		if(index == 1)
			return 1;
		else if(index == 2)
			return 1;
		else {
			int res1 = calcFibonacci(index-1);
			int res2 = calcFibonacci(index-2);
			return res1 + res2;
			
			//Or replace the above three lines with this single line
			//return  calcFibonacci(index-1) + calcFibonacci(index-2);
		}
	}
	
	public static void main(String[] args)
	{
		Scanner scan = new Scanner(System.in);
		System.out.print("Enter a number: ");
		int K = scan.nextInt();
		
		System.out.println("\nPrint the first " + K + " elements of the Fibonacci sequence");

		for(int n=1; n<=K; n++)
			System.out.print(calcFibonacci(n) + ", ");
	}
}