#include<iostream>
#include<fstream>
#include<algorithm>
#include<vector>
#include<set>

using namespace std;
/*
long st(long i)
{
   return 2*i;
}
long dr(long i)
{
    return 2*i+1;
}

void schimb(long &a, long &b)
{
    long ux;
    ux=a;
    a=b;
    b=ux;
}

void check(long a[500100], long i, long n)
{
long max,s,d;

s=st(i);
d=dr(i);
if(a[s]<a[i] && s<=n )max=s;
else max=i;
if(a[d]<a[max] && d<=n )max=d;

if(max!=i ){schimb(a[max],a[i]);
           ;check(a,max,n);}
}


void insertie(long a[500100],long n)
{
long i,j,key;
/*for(j=2;j<=n;j++)
    {
        key = a[j];
        i=j-1;
        while(i>0 && a[i]>key)
            {
                a[i+1] = a[i];
                --i;
            }
        a[i+1] = key;
    }

for(i=2;i<=n;i++)
    for(j=i;j>1 && a[j]<a[j-1];j--)
        schimb(a[j],a[j-1]);


}

*/



int main()
{
ifstream f ("algsort.in");
ofstream o ("algsort.out");


long n,i,a[500100],t;

f>>n;
//vector<int> v(a,a+n);
multiset <int> vector;
multiset <int> :: iterator it;


for(i=0;i<n;i++)
{f>>t;vector.insert(t);}

 // make_heap (v.begin(),v.end());



 // sort_heap (v.begin(),v.end());


  for ( it = vector.begin(); it != vector.end(); it++) o << *it<<" ";













/*//cin>>n;


//for(i=n/2;i>=1;i--)
//check(a,i,n);
insertie(a,n);
for(i=1;i<=n;i++)
o<<a[i]<<" ";
*/
return 0;}