{冒泡排序}
{輸入m,表示要排序的數(shù)的個數(shù)；接著輸入m個整數(shù)；
 輸出從小到大排序后的結(jié)果}

program  p
var  integer  i,j,num;
      array[1..20] of  integer a;

procedure  q(integer num);
var  integer i,j,k;
     integer t;
begin
  i:=1;
  j:=1;
  while i < num do
     j:=num-i+1;
     k:=1;
     while k<j  do
    	 if a[k+1] < a[k]  
         then  t:=a[k];
	       a[k]:=a[k+1];
	       a[k+1]:=t
         else  t:=0
         fi;   
     k:=k+1
     endwh;
  i:=i+1
  endwh
end

begin
   read(num);
   i:=1;
   while i<(num+1)  do
     read(j);
     a[i]:=j;
     i:=i+1
   endwh;
   q(num);
   i:=1;
   while  i<(num+1) do 
       write(a[i]);
       i:=i+1
   endwh
end.