program tri_tab;
uses wincrt;
type
tab=array [1..20] of longint ;
var
t1,t2:tab;
ch:string;
n,e,i:integer;

procedure saisie(var t:tab;z:integer);
var
c1:string;
begin

repeat
writeln('entrer le premier nombre');
readln(t[1]);
str(t[1],c1);
until (t[1]<=99999) and (t[1]>=10000);
for i:=2 to (z) do
begin
repeat
writeln('entrer l element: ',i);
readln(t[i]);
str(t[i],ch);
until (length(ch)=5) and (ch[1]=c1[1]);
end;
end;

procedure permut_t(var z,y:longint);
var
ex:longint;
begin
ex:=z;
z:=y;
y:=ex;
end;

procedure permut_c(var z,y:char);
var
ex:char;
begin
ex:=z;
z:=y;
y:=ex;
end;


function tri_n(z:integer):integer;
var
ver:boolean;
x:integer;
begin
str(z,ch);
repeat
ver:=false;
for i:=1 to (length(ch)-1) do

if ch[i]<ch[i+1] then
begin
permut_c(ch[i],ch[i+1]);
ver:=true;
end;
until ver=false;

val(ch,x,e);
tri_n:=x;
end;


procedure tri_t(var t:tab;z:integer );
var
j,min:integer;
begin
for i:=1 to (z-1) do
min:=i;
for j:=i+1 to z do
if t[j]<t[min] then
begin
permut_t(t[j],t[min]);
min:=j;
end;
end;

begin
repeat
writeln('donner la longueur n');
readln(n);
until n in [5..20];
saisie(t1,n);
for i :=1 to n do
begin
t1[i]:=tri_n(t1[i]);
end;
tri_t(t1,n);
for i:=1 to n do
writeln('l element ',i,' a pour valeur',t1[i]);

end.