#include <iostream>

using namespace std;

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

long a[500000],b[500000];
int n;

void merge(int st,int m,int dr)
{
    int i,j,k=1;
    i = st;
    j = m + 1;
    while(i <= m && j <= dr)
    {
        if(a[i] < a[j])
        {
            b[k] = a[i];
            k++;
            i++;
        }
        else
        {
            b[k] = a[j];
            k++;
            j++;
        }
    }
    while(i <= m)
    {
        b[k] = a[i];
        k++;
        i++;
    }
    while(j <= dr)
    {
        b[k] = a[j];
        k++;
        j++;
    }
    k--;
    for(i = dr ; i >= st ; i--)
    {
        a[i] = b[k];
        k--;
    }
}
void mergesort(int st,int dr)
{
    int m;
    if(st < dr)
    {
        m = (st+dr)/2;
        mergesort(st,m);
        mergesort(m+1,dr);
        merge(st,m,dr);
    }
}

int main()
{
    int i;
    in >> n;
    for(i = 1 ; i <= n ; i++)
        in >> a[i];
    mergesort(1,n);
    for(i = 1 ; i <= n ; i++)
        out << a[i] << " ";
    return 0;
}