function prim(x:integer):boolean;
var y:integer;
f:boolean;
begin
x:=abs(x);
if x<2 then f:=false
else if x=2 then f:=true
else if x mod 2=0 then f:=false
else
begin
f:=true;
y:=3;
while(y*y<=x)and f do
if x mod y=0 then f:=false
else inc(y,2);
end;
prim:=f
end;
var n,i:integer;
begin
repeat
write('Scrie un numar n=');
readln(n);
until prim(n);
i:=n+1;
while not prim(i) do
i:=i+1;
write('Urmatorul numar prim mai mare ca n este=',i);
end.
