const
  max_prime = 50;

function find_factor(being_tested : integer; var primes : array of integer) 
         : integer;
  var
    index : integer;
  begin
    index := 0;
    while ((being_tested mod primes[index]) <> 0) and
           (being_tested > (primes[index] * primes[index])) do
      index := index + 1;
    if (being_tested >= primes[index] * primes[index]) then
      find_factor := primes[index]
    else
      find_factor := being_tested
  end;

var
  primes : array [0..max_prime-1] of integer;
  being_tested : integer;
  index : integer;

begin
  index := 1;
  primes[0] := 2;
  being_tested := 3;
  repeat
    if (find_factor(being_tested, primes) = being_tested) then
      begin
        primes[index] := being_tested;
        index := index + 1
      end;
    being_tested := being_tested + 1
  until index = max_prime;
  index := 0;
  while index < max_prime do
    begin
      writeln(primes[index]);
      index := index + 1
    end
end.