#include <iostream>
#include <fstream>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <stack>
#include <vector>

using namespace std;
ifstream in("algsort.in");
ofstream out("algsort.out");

#define ll long long
#define pb push_back
const int inf = 1e9 + 5;
const int NMax = 5e5 + 5;

int N;
int v[NMax],aux[NMax];

void mergeSort(int,int);

int main() {
    in>>N;
    for (int i=1;i <= N;++i) {
        in>>v[i];
    }

    mergeSort(1,N);

    for (int i=1;i <= N;++i) {
        out<<v[i]<<' ';
    }

    in.close();out.close();
    return 0;
}

void mergeSort(int st,int dr) {
    if (st >= dr) {
        return;
    }

    int mij = (st+dr)>>1;
    mergeSort(st,mij);
    mergeSort(mij+1,dr);

    int i = st, j = mij+1, nrAux = 0;
    while (i <= mij && j <= dr) {
        if (v[i] < v[j]) {
            aux[++nrAux] = v[i++];
        }
        else {
            aux[++nrAux] = v[j++];
        }
    }
    while (i <= mij) {
        aux[++nrAux] = v[i++];
    }
    while (j <= dr) {
        aux[++nrAux] = v[j++];
    }

    for (i=st;i <= dr;++i) {
        v[i] = aux[i-st+1];
    }
}