program Hello;
uses crt;
var n, i, j:longint;
kt:boolean;
begin
readln(n);
kt:= false;
write(n,' = ');
i:= 2;
while n > 1 do
begin
while n mod i <> 0 do
begin
while kt = false do
begin
for j:= 1 to n do
if i mod j = 0 then
begin kt:= false; i:= i+1; break; end;
kt := true;
end;
kt:= false;
end;
n:=n div i;
write(i);
if n>1 then write(' . ');
end;
end.
==================================
program Hello;
uses crt;
var f:array[1..10000] of longint;
i,n:longint;
begin
clrscr;
readln(n);
f[1]:=1;
f[2]:=1;
for i:= 3 to n do
f[i]:=f[i-1]+f[i-2];
for i:= 1 to n do
if n = f[i] then
write('La so fibonacci');
end.