import java.util.Scanner;

public class Fibonacci {

    public static void main(String[] args) {
	Scanner scan = new Scanner( System.in );
	int n;

	do {
	    System.out.print( "\nEnter the fibonacci term: " );
	    n = scan.nextInt();
	} while( n <= 0 );
	
	System.out.println( "fib(" + n + ") = " + fibonacci(n) );
    }
	
    //
    // fibonacci()
    //
    // This is a recursive solution to 
    // calcuate the fibonacci number.
    //
    // Note that in this solution, the base
    // case is implicit by the 
    // initial assignment of the return
    // variable fib.
    //
    private static int fibonacci(int n) {
	int fib = 1;

	//
	// Recursive Case
	if (n >= 2)
	    fib = fibonacci(n-1) + fibonacci(n-2);

	return(fib);

    } // fibonacci
    
} // class