program Primy_Vyber;

const N = 10;
type Pole = array[1..N] of integer;
var i:integer;
    A:Pole;

procedure PrimyVyber(var A: Pole);
var i,j,k: integer;             {indexy prvku}
    X: integer;                 {pro vymenu prvku}
begin
  for i:=1 to N-1 do            {umistit cislo na pozici i}
    begin
    k:=i;
    for j:=i+1 to N do          {vyhledani minima}
      if A[j] < A[k] then k:=j;
    if k > i then               {vymena prvku s indexy i, k}
      begin X:=A[k]; A[k]:=A[i]; A[i]:=X end
    end
end;  {procedure PrimyVyber}

begin
writeln('Zadej ', N, ' tridenych cisel:');
for i:=1 to N do read(A[i]);
PrimyVyber(A);
writeln('Setrideno:');
for i:=1 to N do write(A[i]:5);
writeln
end.