var a:array[1..10000] of longint;
i,n:longint;
procedure qsort(l,r:longint);
var k,i,j,y:longint;
begin
i:=l;
j:=r;
k:=a[(l+r) div 2];

while a[i]<k do inc(I);
while a[j]>k do dec(j);
if i<=j then
begin
y:=a[i]; a[i]:=a[j]; a[j]:=y;
inc(i); dec(j);
end;
if l<j then qsort(l,j);
if i<r then qsort(i,r);
end;

begin
read(n);
for i:=1 to n do
read(a[i]);
qsort(1,n);
for i:=1 to n do
write(a[i],' ');
end.