#include <iostream>
#include <algorithm>
#include <fstream>

using namespace std;

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

const int N = 1e1;
int v[N], aux[N];

void interclasare(int v[], int st, int dr)
{
    int m = (st + dr) / 2;
    int i = st, j = m + 1, k = st;
    while(i <= m && j <= dr)
    {
        if (v[i] <= v[j])
            aux[k++] = v[i++];
        else aux[k++] = v[j++];
    }
    while (i <= m)
    {
        aux[k++] = v[i++];
    }
    while (j <= dr)
    {
        aux[k++] = v[j++];
    }
    for (k = st; k <= dr; k++)
        v[k] = aux[k];
}

void ms(int v[], int st, int dr)
{
    if (st == dr)
        return;
    int m = (st + dr) / 2;
    ms(v, st, m);
    ms(v, m + 1, dr);
    interclasare(v, st, dr);
}

int main()
{
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
        cin >> v[i];
    ms(v, 0, n - 1);
    for (int i = 0; i < n; i++)
        cout << v[i] << ' ';
    return 0;
}