include[HTML_REMOVED]

using namespace std;
const int N=100001;
int q[N],t[N];
void merge_sort(int q[],int l,int r)
{
if(l>=r)return ;
int mid=(l+r)>>1;
merge_sort(q,l,mid);
merge_sort(q,mid+1,r);
int i=l,j=mid+1,k=l;
while(i<=mid&&j<=r)
{
if(q[i]<q[j])t[k]=q[i];
else
t[k]=q[j];

  }
  while (i<=mid) t[k++]=q[i++];
  while (j<=r) t[k++]=q[j++];
  for(int p=l,pp=l;p<=r;p++,pp++)
  q[p]=t[pp];

}
int main()
{

int y;
cin>>y;
for(int p=0;p<y;p++)
cin>>q[p];
merge_sort(q,0,y-1);
for(int p=0;p<y;p++)
printf("%d ",q[p]);







return 0;

}