#include <fstream>
using namespace std;

#define MAX 500005

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

int n, a[MAX], aux[MAX];

void interclasare(int st, int dr, int m)
{
    int i = st, j = m + 1, k = st;
    while(i <= m and j <= dr)
    {
        if(a[i] < a[j])
        {
            aux[k] = a[i];
            i++;
        }
        else
        {
            aux[k] = a[j];
            j++;
        }
        k++;
    }
    for(int l = i; l <= m; ++l)
    {
        aux[k] = a[l];
        k++;
    }
    for(int l = j; l <= dr; ++l)
    {
        aux[k] = a[l];
        k++;
    }
    for(int i = st; i <= dr; ++i)
    {
        a[i] = aux[i];
    }
}

void mergesort(int st, int dr)
{
    if(st == dr)
    {
        return;
    }
    int m = (st + dr) / 2;
    mergesort(st, m);
    mergesort(m + 1, dr);
    interclasare(st, dr, m);
}

int main()
{
    cin.sync_with_stdio(false);
    cin >> n;
    for(int i = 1; i <= n; ++i)
    {
        cin >> a[i];
    }
    mergesort(1, n);
    for(int i = 1; i <= n; ++i)
    {
        cout << a[i] << ' ';
    }
    cout << '\n';
    return 0;
}