program fibonacci(input,output);
{ This program tests a recursive Fibonacci number
  function.  Recall that the first few Fibonacci numbers
  are
        1, 1, 2, 3, 5, 8, 13, 21, 34, ...

  You get the next one by adding the previous two.
 In other
  words, fib(n) = fib(n-1) + fib(n-2).

  Questions:
    1.  Write the body of the function fib(), using recursion.
    
    2.  Try running this program to compute the first 20
        Fibonacci numbers.


    3.  What happens if you try computing the first 100?  Why?
}

var     i, N : integer;

function fib( n : integer ) : integer;
begin
end;

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