Program pr1;
type mas = array [1..20] of byte;
const n=3;
var x :array [1..n]of word;
    y, PD, z :mas;
    r, i, KD :byte;
    b, k :byte;
    P :boolean;
Procedure delit (nc :word; var PD :mas; var k:byte);
 Var i :byte;
 c :word;
 begin k:=0;
 for i:=2 to nc div 2 do begin
 c:=nc mod i;
 If c=0 then begin k:=k+1;
 PD[k]:=i;
 while c=0 do begin nc:=nc div i;
 c:=nc mod i;
              end;
           end;
                          end;
  end;
begin writeln ('¢¢®¤ ¬ á- ');
for i:=1 to n do read (x[i]);
for i:=1 to n do begin delit (x[i], y, KD);
z[i]:=y[KD];
end;
r:=n;
repeat P:=false;
for i:=1 to r do
If z[i]<z[i+1] then begin b:=z[i];
                          z[i]:=z[i+1];
                          z[i+1]:=b;
                          b:=x[i];
                          x[i]:=x[i+1];
                          x[i+1]:=b;
                          P:=true;
                       end;
r:=r-1;
until P=false;
for i:=1 to n do write (x[i]:5);
end.