#include <iostream>
#include <fstream>
#include <math.h>
#include <algorithm>
#include <cstdlib>
#include <time.h>
#include <vector>

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

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

// sortare folosind algoritmul merge sort

int N,K;
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]<<' ';
    }
    out<<'\n';

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

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

    // se sorteaza bucatile [st,mij] si [mij+1,dr] din v
    int mij = (st+dr)>>1;
    mergeSort(st,mij);
    mergeSort(mij+1,dr);

    // se interclaseaza cele doua bucati in vectorul aux
    // si se copiaza elementele ordonate inapoi in v
    merge(v+st,v+mij+1,v+mij+1,v+dr+1,aux+1);
    int dim = (dr-st+1);
    for (int i=1;i <= dim;++i) {
        v[st+i-1] = aux[i];
    }
}