#include <fstream>
#include <vector>

using namespace std;
const int N=500010;
int v[N];
void interclasare(int l1,int r1,int l2,int r2)
{
    vector<int>mat_aux;
    int st=l1;
    while(l1<=r1 && l2<=r2)
    {
        if(v[l1]<=v[l2])
        {
            mat_aux.push_back(v[l1]);
            if(v[l1]==v[l2])
            {
                mat_aux.push_back(v[l1]);
                l2++;
            }
            l1++;
        }
        else
        {
            mat_aux.push_back(v[l2]);
            l2++;
        }
    }
    while(l1<=r1)
        mat_aux.push_back(v[l1++]);
    while(l2<=r2)
        mat_aux.push_back(v[l2++]);
    for(int i=0;i<mat_aux.size();i++)
    {
        v[st++]=mat_aux[i];
    }
}
void merge_sort(int st,int dr)
{
    if(st==dr)
        return;
    int m=(st+dr)/2;
    merge_sort(st,m);
    merge_sort(m+1,dr);
    interclasare(st,m,m+1,dr);
}
int main()
{
    ifstream in("algsort.in");
    ofstream out("algsort.out");
    int n;
    in>>n;
    for(int i=0;i<n;i++)
        in>>v[i];
    merge_sort(0,n-1);
    for(int i=0;i<n;i++)
        out<<v[i]<<' ';
    in.close();
    out.close();
    return 0;
}