include[HTML_REMOVED]

using namespace std;
const int N=100010;
int n,q[N],tmp[N];
void merge_sort(int l,int r,int q[])
{
if(l==r) return;
int mid=(l+r)>>1;
merge_sort(l,mid,q),merge_sort(mid+1,r,q);
int i=l,j=mid+1,k=0;
while(i<=mid&&j<=r)
{
if(q[i]<=q[j]) tmp[k]=q[i];
else tmp[k]=q[j];
}
while(i<=mid) tmp[k]=q[i];
while(j<=r) tmp[k]=q[j];
for(int i=l,j=0;i<=r;i,j)
{
q[i]=tmp[j];
}
return;
}
int main()
{
cin>>n;
for(int i=0;i[HTML_REMOVED]>q[i];
}
merge_sort(0,n-1,q);
for(int i=0;i<n;i++)
{
cout<<q[i]<<” “;
}
return 0;
}