//radix sort(2 ^ 31)

#include <fstream>
#include <algorithm>
#include <cstring>

using namespace std;

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


const int Nmax = 500009;

int N; int A[Nmax];

void Read(){

    fin >> N;

    for(int i = 1; i <= N; ++i)
        fin >> A[i];
}

void Print (){

    for(int i = 1; i <= N; ++i)
        fout << A[i] <<" ";
}

void Solve(){

    sort(A + 1, A  + N + 1);
}


int main(){

    Read ();

    Solve ();

    Print ();

    return 0;
}