{==============================================================
	recursiveFib.p
	
	Started by Jeff Ondich on 10/23/96
	Last modified 10/23/96
	
	This program computes Fibonacci numbers recursively.
 ==============================================================}

program fib(input,output);

var		N : integer;


{==============================================================
	Fibonacci returns the nth Fibonacci number.
 ==============================================================}
function Fibonacci( n : integer ) : integer;
begin
	if n <= 2 then
		Fibonacci := 1
	else
		Fibonacci := Fibonacci(n-1) + Fibonacci(n-2)
end;


{==============================================================
	Main program
 ==============================================================}
begin
	write( 'N = ' );
	readln( N );
	
	writeln( 'The ', N, 'th fibonacci number is ', Fibonacci(N) )
end.