#include <iostream>
#include <fstream>
#include <queue>

using namespace std;

ifstream fin("algsort.in");
ofstream fout("algsort.out");

const int MAX=5e5+5;
int v[MAX],n;

void quicksort(int st, int dr)
{
    queue < pair < int, int > > q;
    q.push({st,dr});
    while(!q.empty())
    {
        st=q.front().first;
        dr=q.front().second;
        q.pop();
        if(st>=dr)
            continue;
        int m=(st+dr)/2;
        swap(v[st],v[m]);
        int i=st,j=dr;
        int ii=0,jj=1;
        while(i<j)
        {
            if(v[i]>v[j])
            {
                swap(v[i],v[j]);
                swap(ii,jj);
            }
            i+=ii;
            j-=jj;
        }
        q.push({st,i-1});
        q.push({i+1,dr});
    }
}

int main()
{
    fin >> n;
    for(int i=1;i<=n;i++)
        fin >> v[i];
    quicksort(1,n);
    for(int i=1;i<=n;i++)
        fout << v[i] << " ";
    return 0;
}