Program FibonacciSequence ; {Fibonacci s rekurzi}

uses CRT;

function FibonacciNumber( n : integer ): integer;

begin

  if n=0 then begin FibonacciNumber:=0; writeln('  ',FibonacciNumber); end

         else if n=1 then begin FibonacciNumber:=1;  writeln('  ',FibonacciNumber); end

                     else begin FibonacciNumber:= ( FibonacciNumber( n - 1 ) + FibonacciNumber( n - 2 ) );

                                writeln('  ',FibonacciNumber); end

           end;

var Fib,number:integer;

begin

clrscr;

write('     Zadej poradi (do 23) v Fibonacciho posloupnosti: ');

Readln(number);

Fib:=FibonacciNumber(number);

Writeln('     Fib(',number,') = ',Fib);

repeat until keypressed;

end.