var
a:array[0..10000000]of longint;
n,i,j,k:longint;
procedure qsort(l,r:longint);
var
x,i,j:longint;
begin
x:=a[l];i:=l;j:=r;
while i<j do
begin
while(i<j)and(a[j]>=x)do j:=j-1;
a[i]:=a[j];
while(i<j)and(a[i]<=x)do i:=i+1;
a[j]:=a[i];
end;
a[i]:=x;
if l<i-1 then qsort(l,i-1);
if i+1>r then qsort(i+1,r);
end;

begin
assign(input,'sorttest.in'); reset(input);
assign(output,'sorttest.out'); rewrite(output);
read(n);
for i:=1 to n do read(a[i]);
qsort(1,n);
for i:=1 to n do write(a[i],' ');
close(input);
close(output);
end.