#include
#include<bits/stdc++.h>
#define ll long long int
using namespace std;
void merge(ll *a,ll s,ll e)
{
ll temp[e-s+1];
ll mid=(s+e)/2;
ll i=s;
ll j=mid+1;
ll k=s;
while(i<=mid && j<=e)
{
if(a[i]<a[j])
{
temp[k++]=a[i++];
}
else
{
temp[k++]=a[j++];
}
}
while(i<=mid)
{
temp[k++]=a[i++];
}
while(j<=e)
{
temp[k++]=a[j++];
}
for(ll i=s;i<=e;i++)
{
a[i]=temp[i];
}
}
void mergesort(ll a[],ll s,ll e)
{
if(s>=e){
return ;
}
ll mid=s+(e-s)/2;
mergesort(a,s,mid);
mergesort(a,mid+1,e);
merge(a,s,e);
}
int main() {
ll n;
cin>>n;
ll a[n];
for(ll i=0;i<n;i++)
{
cin>>a[i];
}
mergesort(a,0,n-1);
for(ll i=0;i<n;i++)
{
cout<<a[i]<<" ";
}
cout<<endl;
return 0;
}