#include <fstream>
#include <algorithm>

using namespace std;

int V[500001];

void mergeSort(int *b, int *e) {
    if(b == e-1) return;
    int *m = b + (e-b)/2;
    mergeSort(b, m);
    mergeSort(m, e);
    inplace_merge(b, m, e);
}

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

    int n;
    fin>>n;
    for(int i=1; i<=n; i++)
        fin>>V[i];
    mergeSort(V+1, V+n+1);
    for(int i=1; i<=n; i++)
        fout<<V[i]<<" ";
    return 0;
}