prime numbers till n

program lolkek;

var
  a, i, b: integer;
  ans:boolean;

function pr(a: integer): boolean;
var
  i: integer;
  ans: boolean;
begin
  ans := False;
  for i := 2 to (a - 1) do
  begin
    if (a mod i) = 0 then
      ans := True;
  end;
  result := ans;
end;

begin
  for i:= 1 to 500 do
  begin
  if not(pr(i,b,ans)) then
  writeln(i);
  end;
end.