public class Fibonacci
{
	public static int recursiveFibonacci(int n)
	{
		if(n <= 2)
		{
			return 1;
		}
		else
		{
			//n > 2, so n-1 > 0 and n-2 > 0)
			System.out.println("Fibonacci(" + (n-1) +
								") + Fibonacci(" + (n-2) + ")");
			return fib(n-1) + fib(n-2);
		}//end if
	}

	public static void main(String[] args)
	{
		int count = 7;
		int result = 0;

		System.out.println("Fibonacci series....");
		result = recursiveFibonacci(count);
		System.out.println("Finished......");
		System.out.println("Result: " + result);
	}
}