{
	fib.p

	The Fibonacci numbers are

	 1 1 2 3 5 8 13 21 34 ...

	You get the next number by adding the previous two.
	This program computes Fibonacci numbers upon request,
	using a straight-forward recursive function.
	Do you really want to compute Fibonacci numbers
	this way?
}

program fibonacci(input,output);

var     i, N : integer;

function fib( n : integer ) : integer;
begin
	if n <= 2 then
		fib := 1
	else
		fib := fib(n-1) + fib(n-2)
end;

begin
	write( 'How many Fibonacci numbers do you want? ' );
	readln( N );
	for i := 1 to N do
		writeln( i, fib(i) );
	writeln
end.