var
i,j,n:longint;
a:array[1..1000000] of longint;
procedureqsort(l,r:longint);var
m,t:longint;
begin
i:=l;j:=r;
m:=a[(l+r) div2];
repeatwhile a[i]<m do inc(i);
while a[j]>m do dec(j);
if i<=j thenbegin
t:=a[i];
a[i]:=a[j];
a[j]:=t;
inc(i);
dec(j);
end;
until i>j;
if l<j then qsort(l,j);
if i<r then qsort(i,r);
end;
begin
readln(n);
for i:=1to n doread(a[i]);
qsort(1,n);
for i:=1to n dowrite(a[i],' ');
end.