/*  Recursive Fibonacci function in Java by www.computing.me.uk */

class Fibonacci
{
	public static void main(String args[])
	{

//Place the index for the term of the Fibonaaci sequence is to be found within the brackets
		System.out.println(fibonacci(5));

	}

// recursive Fibonnaci function
        static int fibonacci(int n)
        {
	        if (n<=2) return(1);
                else return (fibonacci(n-1)+fibonacci(n-2));
        }

}